New results on binary space partitions in the plane (extended abstract)

DOI10.1007/3-540-58218-5_6zbMath1502.68312OpenAlexW1593752537MaRDI QIDQ5056166

Marko M. de Groot, Mark H. Overmars, Mark T. 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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects ⋮ Approximate range searching using binary space partitions ⋮ Dynamic data structures for fat objects and their applications

Cites Work

• Unnamed Item
• Efficient binary space partitions for hidden-surface removal and solid modeling
• On the optimal binary plane partition for sets of isothetic rectangles
• 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

This page was built for publication: New results on binary space partitions in the plane (extended abstract)