The Complexity of Finding Small Triangulations of Convex 3-Polytopes
Below, Alexander · De Loera, Jesús A. · Richter-Gebert, Jürgen
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.