Efficient binary space partitions for hidden-surface removal and solid modeling
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
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
Kinetic binary space partitions for intersecting segments and disjoint triangles
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
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)
Improved approximation algorithms for rectangle tiling and packing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Binary space partitions for axis-parallel segments, rectangles, and hyperrectangles
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
A note on binary plane partitions
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
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 3D subdivisions
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
This paper considers binary space partitions (BSP) for n disjoint line segments in the plane. It is known that there is a BSP of size at most O(n log n), in general, and the smallest BSP can be as big as Ω(n log n/log log n) in the worst case. It is shown that there exists a BSP of size O(kn) if the line segments have at most k different orientations. No linear upper bound was known, so far, for any fixed k 2.