Linear size binary space partitions for uncluttered scenes

DOI10.1007/S004530010047zbMATH Open0960.68160OpenAlexW2120039945MaRDI QIDQ1587784FDOQ1587784

Authors: Mark de Berg 

Publication date: 3 December 2000

Published in: Algorithmica (Search for Journal in Brave)

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

Recommendations

• Linear size binary space partitions for fat objects
• New results on binary space partitions in the plane (extended abstract)
• New results on binary space partitions in the plane
• Optimal binary space partitions for orthogonal objects
• Binary Space Partitions for Fat Rectangles

zbMATH Keywords

binary space partitionsuncluttered scenes

Mathematics Subject Classification ID

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

Cited In (28)

• Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications
• Multi-way space partitioning trees.
• An optimal-time algorithm for shortest paths on realistic polyhedra
• On realistic terrains
• Binary plane partitions for disjoint line segments
• Approximating the packedness of polygonal curves
• Delaunay Triangulation of Imprecise Points Simplified and Extended
• Guarding scenes against invasive hypercubes.
• Spanning trees crossing few barriers
• Conflict neutralization on binary space partitioning
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• Walking around fat obstacles.
• Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
• Approximating the Fréchet distance for realistic curves in near linear time
• Local polyhedra and geometric graphs
• Kinetic collision detection for convex fat objects
• Linear size binary space partitions for fat objects
• Approximate range searching using binary space partitions
• Smoothed analysis of probabilistic roadmaps
• Preprocessing imprecise points for Delaunay triangulation: simplified and extended
• Connect the Dot: Computing Feed-Links with Minimum Dilation
• Characterizing regions of attraction for piecewise affine systems by continuity of discrete transition functions
• Approximating the Packedness of Polygonal Curves
• I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions
• Optimal binary space partitions for segments in the plane
• Eliminating depth cycles among triangles in three dimensions
• Removing depth-order cycles among triangles: an algorithm generating triangular fragments
• Models and motion planning

This page was built for publication: Linear size binary space partitions for uncluttered scenes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587784)