Approximating the minimum triangulation of convex 3-polytopes with bounded degrees

DOI10.1016/j.comgeo.2005.03.001zbMath1084.65020OpenAlexW2027415676MaRDI QIDQ2387200

Stanley P. Y. Fung, Chung Keung Poon, Francis Y. L. Chin

Publication date: 2 September 2005

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

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

zbMATH Keywords

convex 3-polytopesapproximative minimum triangulationsCutPull method

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• Triangulating a nonconvex polytope
• Minimal simplicial dissections and triangulations of convex 3-polytopes
• Tetrahedrizing point sets in three dimensions
• Arboricity and Subgraph Listing Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating the minimum triangulation of convex 3-polytopes with bounded degrees