Computational geometry column 40

DOI10.1142/S021819590000036XMaRDI QIDQ2708044zbMATH OpenOpenAlexFDO

Authors Joseph O'Rourke

Publication date 17 April 2001

Published in International Journal of Computational Geometry \& Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s021819590000036x

zbMATH Keywords

3SAT-reduction proofconvex polyhedron

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 1445288
• The complexity of finding small triangulations of convex 3-polytopes
• Finding small triangulations of polytope boundaries is hard
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• Approximation for minimum triangulation of convex polyhedra

Cites work

• Minimal simplicial dissections and triangulations of convex 3-polytopes

Cited in

(11)

• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
• On triangulating three-dimensional polygons
• Finding small triangulations of polytope boundaries is hard
• Computational Geometry Column 34
• The complexity of finding small triangulations of convex 3-polytopes
• scientific article; zbMATH DE number 1445288 (Why is no real title available?)
• On the complexity of approximating and illuminating three-dimensional convex polyhedra
• COMPUTATIONAL GEOMETRY COLUMN 48
• COMPUTATIONAL GEOMETRY COLUMN 47
• One strike against the min-max degree triangulation problem

This page was built for publication: Computational geometry column 40

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