Binary partitions with applications to hidden surface removal and solid modelling
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Optimal binary space partitions for orthogonal objects
Journal of Algorithms
Perfect binary space partitions
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
New results on binary space partitions in the plane
Computational Geometry: Theory and Applications
Optimal binary space partitions for orthogonal objects
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Binary Space Partitions for Fat Rectangles
SIAM Journal on Computing
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
Predetermining visibility priority in 3-D scenes (Preliminary Report)
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
ACM SIGACT News
Binary space partitions for line segments with a limited number of directions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Binary space partitions for axis-paralles line segments: size-height tradeoffs
Information Processing Letters
Binary space partitions for 3D subdivisions
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
This paper considers {\sl binary space partition}s (BSP for short) for $n$ disjoint line segments in the plane. The BSP for a disjoint set of objects is a scheme dividing the space recursively by hyperplanes until the resulting fragments of objects are separated. The size of a BSP is the number of resulting fragments of the objects. We show that the minimal size of a BSP for $n$ disjoint line segments in the plane is $\Omega (n \log n / \log \log n)$ in the worst case. The best known upper bound due to Paterson and Yao is $O(n \log n)$.