Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon

DOI10.1016/0925-7721(95)00011-9zbMath0857.68100OpenAlexW2067919151MaRDI QIDQ1924710

Leonidas Palios

Publication date: 20 October 1996

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

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00011-9

zbMATH Keywords

tetrahedralization

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangulating a nonconvex polytope
• Cell decomposition of polytopes by bending
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Finding the intersection of two convex polyhedra
• Bounds on the size of tetrahedralizations
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Convex Decomposition of Polyhedra and Robustness
• POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS