New results on binary space partitions in the plane (extended abstract)
From MaRDI portal
Publication:5056166
DOI10.1007/3-540-58218-5_6zbMATH Open1502.68312OpenAlexW1593752537MaRDI QIDQ5056166FDOQ5056166
Marko M. de Groot, Mark H. Overmars, Mark de Berg
Publication date: 9 December 2022
Published in: Algorithm Theory — SWAT '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-58218-5_6
Recommendations
Cites Work
- Title not available (Why is that?)
- A New Approach to Planar Point Location
- The complexity of the free space for a robot moving amidst fat obstacles
- Computing the extreme distances between two convex polygons
- Optimal binary space partitions for orthogonal objects
- Efficient binary space partitions for hidden-surface removal and solid modeling
- On the optimal binary plane partition for sets of isothetic rectangles
Cited In (7)
- Dynamic data structures for fat objects and their applications
- Binary space partitions: recent developments
- New lower bounds for Tverberg partitions with tolerance in the plane
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Linear size binary space partitions for fat objects
- Linear size binary space partitions for uncluttered scenes
- Approximate range searching using binary space partitions
This page was built for publication: New results on binary space partitions in the plane (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056166)