Decompositions and boundary coverings of non-convex fat polyhedra
DOI10.1016/J.COMGEO.2009.04.003zbMATH Open1181.52017OpenAlexW2057386292MaRDI QIDQ1037773FDOQ1037773
Authors: Chris Gray, Mark 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
Recommendations
- Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
- On the union of fat tetrahedra in three dimensions
- Approximation for minimum triangulation of convex polyhedra
- Convex Decomposition of Polyhedra and Robustness
- scientific article; zbMATH DE number 2123350
- Unions of fat convex polytopes have short skeletons
- On fat partitioning, fat covering and the union size of polygons
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Minimal simplicial dissections and triangulations of convex 3-polytopes
- The Union of Convex Polyhedra in Three Dimensions
Three-dimensional polytopes (52B10) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Computational geometry. Algorithms and applications.
- Triangulating a simple polygon in linear time
- The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
- Improved bounds on the union complexity of fat objects
- Ray shooting, depth orders and hidden surface removal
- Realistic input models for geometric algorithms
- Title not available (Why is that?)
- Ray shooting and intersection searching amidst fat convex polyhedra in 3-space
- On fat partitioning, fat covering and the union size of polygons
- The complexity of the free space for motion planning amidst fat obstacles
- Vertical Ray Shooting and Computing Depth Orders for Fat Objects
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- On Translational Motion Planning of a Convex Polyhedron in 3-Space
- Guarding scenes against invasive hypercubes.
- Efficient binary space partitions for hidden-surface removal and solid modeling
- Local polyhedra and geometric graphs
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra in Convex Pieces
Cited In (1)
This page was built for publication: Decompositions and boundary coverings of non-convex fat polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1037773)
