New results on binary space partitions in the plane
From MaRDI portal
Publication:1370930
DOI10.1016/S0925-7721(97)00008-4zbMath0883.68129MaRDI QIDQ1370930
Mark H. Overmars, Marko M. de Groot, Mark T. de Berg
Publication date: 28 October 1997
Published in: Computational Geometry (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Binary plane partitions for disjoint line segments, Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
Cites Work
- Unnamed Item
- Dynamic fractional cascading
- Efficient binary space partitions for hidden-surface removal and solid modeling
- Fractional cascading. I: A data structuring technique
- Fractional cascading. II: Applications
- Triangulating a simple polygon in linear time
- On the optimal binary plane partition for sets of isothetic rectangles
- Ray shooting, depth orders and hidden surface removal
- The complexity of the free space for a robot moving amidst fat obstacles
- Computing the extreme distances between two convex polygons
- A New Approach to Planar Point Location
- Optimal binary space partitions for orthogonal objects