Decompositions and boundary coverings of non-convex fat polyhedra

DOI10.1016/j.comgeo.2009.04.003zbMath1181.52017OpenAlexW2057386292MaRDI QIDQ1037773

Chris Gray, Mark T. de Berg

Publication date: 16 November 2009

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2009.04.003

zbMATH Keywords

decompositionfatnesstetrahedralization

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Three-dimensional polytopes (52B10) Computational aspects related to convexity (52B55) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient binary space partitions for hidden-surface removal and solid modeling
• Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
• Improved bounds on the union complexity of fat objects
• Triangulating a simple polygon in linear time
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Ray shooting, depth orders and hidden surface removal
• On fat partitioning, fat covering and the union size of polygons
• Guarding scenes against invasive hypercubes.
• Local polyhedra and geometric graphs
• The complexity of the free space for motion planning amidst fat obstacles
• Realistic input models for geometric algorithms
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
• Vertical Ray Shooting and Computing Depth Orders for Fat Objects
• On Translational Motion Planning of a Convex Polyhedron in 3-Space
• The Complexity of the Union of $(\alpha,\beta)$-Covered Objects

This page was built for publication: Decompositions and boundary coverings of non-convex fat polyhedra