Linear size binary space partitions for fat objects

DOI10.1007/3-540-60313-1_148zbMath1512.68410OpenAlexW1565569273MaRDI QIDQ6102305

Mark T. de Berg

Publication date: 8 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60313-1_148

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Models and motion planning ⋮ Adaptive estimation of multivariate piecewise polynomials and bounded variation functions by optimal decision trees ⋮ Smoothed analysis of probabilistic roadmaps

Cites Work

• Efficient binary space partitions for hidden-surface removal and solid modeling
• Point location in fat subdivisions
• On the union of fat wedges and separating a collection of segments by a line
• Optimal binary space partitions for orthogonal objects
• Design and implementation of an efficient priority queue
• Fat Triangles Determine Linearly Many Holes
• Computing and Verifying Depth Orders
• Computing depth orders and related problems
• On fat partitioning, fat covering and the union size of polygons

This page was built for publication: Linear size binary space partitions for fat objects