Linear size binary space partitions for fat objects

DOI10.1007/3-540-60313-1_148zbMATH Open1512.68410OpenAlexW1565569273MaRDI QIDQ6102305FDOQ6102305

Authors: Mark 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

Recommendations

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Adaptive estimation of multivariate piecewise polynomials and bounded variation functions by optimal decision trees
• Models and motion planning
• New results on binary space partitions in the plane (extended abstract)
• Linear size binary space partitions for uncluttered scenes
• Smoothed analysis of probabilistic roadmaps

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

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