Minimum-weight triangulation is NP-hard

Details Minimum-weight triangulation is NP-hard Minimum-weight triangulation is NP-hard

2006-01-02

arxiv.org/abs/cs/0601002v3

Journal of the ACM, 55, no. 2 (May 2008), Article 11, 29 pp.

Computer Science

Computational Geometry

45 pages (including a technical appendix of 13 pages), 28 figures. This revision contains a few improvements in the exposition

Scientific paper

10.1145/1346330.1346336

A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum-weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge lengths. We prove that the decision version of this problem is NP-hard. We use a reduction from PLANAR-1-IN-3-SAT. The correct working of the gadgets is established with computer assistance, using dynamic programming on polygonal faces, as well as the beta-skeleton heuristic to certify that certain edges belong to the minimum-weight triangulation.

Affiliated with

Also associated with

No associations

Rating

Minimum-weight triangulation is NP-hard 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 Minimum-weight triangulation is NP-hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimum-weight triangulation is NP-hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-40758