The Complexity of Finding Small Triangulations of Convex 3-Polytopes

Details The Complexity of Finding Small Triangulations of Convex 3-Polytopes The Complexity of Finding Small Triangulations of Convex 3-Polytopes

2000-12-18

arxiv.org/abs/math/0012177v1

Mathematics

Combinatorics

37 pages. An earlier version containing the sketch of the proof appeared at the proceedings of SODA 2000

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Complexity of Finding Small Triangulations of Convex 3-Polytopes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Complexity of Finding Small Triangulations of Convex 3-Polytopes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Complexity of Finding Small Triangulations of Convex 3-Polytopes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-256500