28 search results - page 1 / 6 » Binary plane partitions for disjoint line segments |
COMPGEOM
2009
ACM
13 years 11 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 ...
COMPGEOM
2009
ACM
13 years 11 months ago
2009
ACM
We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of n vertices in the plane, where each ray starts at t...
CCCG
2007
13 years 6 months ago
2007
The empty space around n disjoint line segments in the plane can be partitioned into n + 1 convex faces by extending the segments in some order. The dual graph of such a partition...
COMGEO
2010
ACM
13 years 5 months ago
2010
ACM
For n disjoint line segments in the plane we construct in optimal O(n log n) time and linear space an encompassing tree of maximum degree three such that at every vertex all incid...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...