Affordable Access

The Complexity of Finding Small Triangulations of Convex 3-Polytopes

Authors
  • Below, Alexander
  • De Loera, Jesús A.
  • Richter-Gebert, Jürgen
Type
Preprint
Publication Date
Dec 18, 2000
Submission Date
Dec 18, 2000
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.

Report this publication

Statistics

Seen <100 times