scientific article; zbMATH DE number 1445288

MaRDI QIDQ4952601zbMATH OpenFDO

Authors

Publication date 29 January 2001

zbMATH Keywords

computational complexityconvex polytopeminimal-size triangulationNP-hard

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The complexity of finding small triangulations of convex 3-polytopes
• Finding small triangulations of polytope boundaries is hard
• Computational geometry column 40
• On the difficulty of triangulating three-dimensional nonconvex polyhedra
• On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees

Cited in

(13)

• On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees
• Asymptotically efficient triangulations of the d-cube
• Finding small triangulations of polytope boundaries is hard
• Local polyhedra and geometric graphs
• N P-hardness of largest contained and smallest containing simplices for V- and H-polytopes
• The polytope of all triangulations of a point configuration
• On simple polygonalizations with optimal area
• Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
• Computational geometry column 40
• scientific article; zbMATH DE number 1305490 (Why is no real title available?)
• The complexity of finding small triangulations of convex 3-polytopes
• On the complexity of approximating and illuminating three-dimensional convex polyhedra
• Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard

This page was built for publication:

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