21 search results - page 1 / 5 » Optimal Binary Space Partitions in the Plane |
80
Voted
COCOON
2010
Springer
15 years 2 months ago
2010
Springer
105
click to vote
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
A binary space partition (BSP) for a set of disjoint objects in Euclidean space is a recursive decomposition, where each step partitions the space (and some of the objects) along ...
IPL
2002
14 years 9 months ago
2002
We present worst-case lower bounds on the minimum size of a binary space partition (BSP) tree as a function of its height, for a set S of n axis-parallel line segments in the plan...
COMPGEOM
1997
ACM
15 years 1 months ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
FSTTCS
2004
Springer
15 years 3 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, ...