88 search results - page 1 / 18 » Approximate Range Searching Using Binary Space Partitions |
FSTTCS
2004
Springer
13 years 10 months ago
2004
Springer
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, ...
SIBGRAPI
2008
IEEE
13 years 11 months ago
2008
IEEE
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...
ICML
2009
IEEE
14 years 5 months ago
2009
IEEE
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...
ALGORITHMICA
2000
13 years 4 months ago
2000
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 ...
TIP
2008
13 years 4 months ago
2008
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...