Affordable Access

The Complexity of Finding Small Triangulations of Convex 3-Polytopes

Authors
Type
Preprint
Publication Date
Submission Date
Identifiers
arXiv ID: math/0012177
Source
arXiv
License
Unknown
External links

Abstract

The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.

Statistics

Seen <100 times