We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
Marcos Lage, Alex Laier Bordignon, Fabiano Petrone...
Reinforcement Learning methods for controlling stochastic processes typically assume a small and discrete action space. While continuous action spaces are quite common in real-wor...
We describe a new and simple method for constructing binary space partitions in arbitrary dimensions. We also introduce the concept of uncluttered scenes, which are scenes with a ...
This paper discusses the use of Binary Partition Trees (BPTs) for object detection. BPTs are hierarchical region-based representations of images. They define a reduced set of regio...