Minimum weight triangulation is NP-hard

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 1-10

  Mulzer, Wolfgang ^a   Rote, Günter ^b  

^a Princeton University   (United States)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Optimal triangulations; PLANAR 1 IN 3 SAT

Indexed keywords

COMPUTATIONAL COMPLEXITY; DECISION THEORY; DYNAMIC PROGRAMMING; GRAPH THEORY; HEURISTIC METHODS; PROBLEM SOLVING;

MINIMUM WEIGHT TRIANGULATION (MWT); OPTIMAL TRIANGULATIONS; VERTEX SET;

SET THEORY;

EID: 33748085387     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. E. Anagnostou and D. Cornell. Polynomial time instances of the minimum weight triangulation problem. Computational Geometry: Theory and Applications 3 (1993), 247-258.
2. R. Beirouti and J. Snoeyink. Implementations of the LMT heuristic for minimum weight triangulations. Proc. 14th Ann. Symp. Computat. Geometry, Minneapolis, pp. 96-105, 1998.
3. M. Bern and D. Eppstein. Approximation algorithms for geometric problems in Approximation Algorithms for NP-Hard Problems, ed. D. S. Hochbaum, PWS Publishing Company, Boston, Mass., 1997, pp. 296-345.
4. P. Belleville, M. Keil, M. McAllister, and J. Snoeyink. On computing edges that are in all minimum weight triangulations. Proceedings of the 12th Annual Symposium on Computational Geometry, Philadelphia, pp. V7-V8, 1996.
5. P. Bose, L. Devroye, and W. Evans. Diamonds are not a minimum weight triangulation's best friends. Proceedings of the 8th Canadian Conference on Computational Geometry, Ottawa, pp. 68-73, 1996.
6. S. W. Cheng, M. J. Golin, and J. C. F. Tsang. Expected case analysis of 3-skeletons with applications to the construction of minimum weight triangulations. Proceedings of the 8th Canadian Conference on Computational Geometry, Ottawa, pp. 279-284, 1996.
7. S. W. Cheng, N. Katoh, and M. Sugai. A study of the LMT-skeleton. Proceedings of the 7th Annual International Symposium on Algorithms and Computation, Osaka, Japan. Springer Lecture Notes in Computer Science, volume 1178, pp. 256-265, 1996.
8. S. W. Cheng and Y. F. Xu. Approaching the largest β-skeleton within a minimum weight triangulation. Proceedings of the 12th Annual Symposium on Computational Geometry, Philadelphia, Pennsylvania, pp. 196-203, 1996.
9. G. Das and D. Joseph. Which triangulations approximate the complete graph. Proceedings of the International Symposium on Optimal Algorithms, Varna, Bulgaria. Springer Lecture Notes in Computer Science, volume 401, pp. 168-192, 1989.
10. M. T. Dickerson, J. M. Keil, and M. H. Montague. A large subgraph of the minimum weight triangulation. Discrete and Computational Geometry 18 (1997), 289-304.
11. R. L. Drysdale, S. A. McElfresh, and J. Snoeyink. On exclusion regions for optimal triangulations. Discrete Applied Mathematics 109 (2001), 49-65.
12. R. L. Drysdale, G. Rote, and O. Aichholzer. A simple linear time greedy triangulation algorithm for uniformly distributed points. IIG-Report-Series 408, Technische Universität Graz, 1995.
13. R. D. Duppe and H. J. Gottschalk. Automatische Interpolation von Isolinien bei willkürlichen Stützpunkten. Allgemeine Vermessungsnachrichten 77 (1970), 423-426.
14. M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, New York, 1979.
15. P. D. Gilbert. New results in planar triangulations. Report R-850, Coordinated Science Laboratory, University of Illinois, Urbana, Illinois, 1979.
16. R. Hainz, O. Aichholzer, and F. Aurenhammer. New results on minimum weight triangulations and the LMT-skeleton. Proceedings of the 18th European Workshop on Computational Geometry, Würzburg, Germany, pp. 4-6, 1997.
17. M. Hoffmann and Y. Okamoto. The minimum weight triangulation problem with few interior points. Proceedings of the International Workshop on Parameterized and Exact Computation, Bergen, Norway, Springer Lecture Notes in Computer Science, volume 3162, pp. 200-212, 2004.
18. D. Johnson. The NP-completeness column. ACM Trans. Algorithms 1 (2005), 160-176.
19. J. M. Keil. Computing a subgraph of the minimum weight triangulation. Computational Geometry: Theory and Applications 4 (1994), 13-26.
20. G. T. Klincsek. Minimal triangulations of polygonal domains. Annals of Discrete Mathematics, volume 9, 1980, pp. 121-123.
21. D. E. Knuth and A. Raghunathan. The problem of compatible representatives. SIAM Journal on Discrete Mathematics 5 (1992), 422-427.
22. D. Lichtenstein. Planar formulae and their uses. SIAM J. Computing 11 (1982), 329-343.
23. D. G. Kirkpatrick. A note on Delaunay and optimal triangulations. Information Processing Letters 10 (1980), 127-128.
24. Y. Kyoda, K. Imai, F. Takeuchi, and A. Tajima. A branch-and-cut approach for minimum weight triangulation. Proceedings of the 8th International Symposium on Algorithms and Computation, Singapore. Springer Lecture Notes in Computer Science, volume 1350, pp. 384-393, 1997.
25. C. Levcopoulos. An Ω (√n) lower bound for the nonoptimality of the greedy triangulation. Information Processing Letters 25 (1987), 247-251.
26. C. Levcopoulos and D. Krznaric. Quasi-greedy triangulations approximating the minimum weight triangulation. Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, Georgia, 1996, pp. 392-401.
27. E. L. Lloyd. On triangulations of a set of points in the plane. Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science, Providence, Rhode Island, pp. 228-240, 1977.
28. G. K. Manacher and A. L. Zobrist. Neither the greedy nor the the Delaunay triangulation approximates the optimum. Information Processing Letters 9 (1979), 31-34.
29. D. A. Plaisted and J. Hong. A heuristic triangulation algorithm. Journal of Algorithms 8 (1987), 405-437.
30. J. Remy and A Steger. A quasi-polynomial time approximation scheme for minimum weight triangulation. Proceedings of the 38th ACM Symposium on Theory of Computing, Seattle, Washington, 2006.
31. O. Schwarzkopf. The extensible drawing editor Ipe. Proceedings of the 11th Annual Symposium on Computational Geometry, Vancouver, British Columbia, pp. 410-411, 1995.
32. M. I. Shamos and D. Hoey. Closest point problems. Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, California, pp. 151-162, 1975.
33. B. T. Yang, Y. F. Xu, and Z. Y. You. A chain decomposition algorithm for the proof of a property on minimum weight triangulations. Proceedings of the 5th Annual International Symposium on Algorithms and Computation, Beijing, China. Springer Lecture Notes in Computer Science, volume 834, pp. 423-427, 1994.