Perfect binary space partitions

DOI10.1016/0925-7721(95)00045-3zbMath0869.68108OpenAlexW2081850681MaRDI QIDQ676587

Marko M. de Groot, Mark T. de Berg, Mark H. Overmars

Publication date: 18 March 1997

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/16541

zbMATH Keywords

binary space partition

Mathematics Subject Classification ID

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

Related Items (3)

Matching Triangles and Basing Hardness on an Extremely Popular Conjecture ⋮ OPTIMAL BINARY SPACE PARTITIONS FOR SEGMENTS IN THE PLANE ⋮ On optimal cuts of hyperrectangles

Cites Work

• Efficient binary space partitions for hidden-surface removal and solid modeling
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Visibility of disjoint polygons
• Maintenance of configurations in the plane
• Better lower bounds on detecting affine and spherical degeneracies
• On a class of \(O(n^ 2)\) problems in computational geometry
• An Output-Sensitive Algorithm for Computing Visibility Graphs
• Optimal binary space partitions for orthogonal objects
• Computing and Verifying Depth Orders

This page was built for publication: Perfect binary space partitions