Flip Distance Between Triangulations of a Simple Polygon is NP-Complete
Let T be a triangulation of a simple polygon. A flip in T is the operation of replacing one diagonal of T by a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the smallest number of flips required to transform one triangulation into the other. For the special case of convex polygons, the problem of determining the shortest flip distance between two triangulations is equivalent to determining the rotation distance between two binary trees, a central problem which is still open after over 25 years of intensive study. We show that computing the flip distance between two triangulations of a simple polygon is NP-hard. This complements a recent result that shows APX-hardness of determining the flip distance between two triangulations of a planar point set.
KeywordsTriangulations Flip distance Simple polygon
Mathematics Subject Classification68U05
O. Aichholzer and A. Pilz were supported by the ESF EUROCORES programme EuroGIGA - ComPoSe, Austrian Science Fund (FWF): I 648-N18. W. Mulzer was supported in part by DFG project MU/3501/1. Part of this work was done while A. Pilz was recipient of a DOC-fellowship of the Austrian Academy of Sciences at the Institute for Software Technology, Graz University of Technology, Austria. Preliminary versions have appeared as O. Aichholzer, W. Mulzer, and A. Pilz, Flip Distance Between Triangulations of a Simple Polygon is NP-Complete in Proc. 29th EuroCG, pp. 115–118, 2013, and in Proc. 21st ESA, pp. 13–24, 2013 [2, 3].
- 2.Aichholzer, O., Mulzer, W., Pilz, A.: Flip distance between triangulations of a simple polygon is NP-complete. In: Proceedings of 29th European Workshop on Computational Geometry, pp. 115–118. EWCG, Braunschweig (2013)Google Scholar
- 3.Aichholzer, O., Mulzer, W., Pilz, A.: Flip distance between triangulations of a simple polygon is NP-complete. In: Bodlaender, H.L., Italiano, G.F. (eds.) Algorithms—ESA 2013—21st Annual European Symposium, Sophia Antipolis, France, 2–4 September 2013. Lecture Notes in Computer Science, vol. 8125, pp. 13–24. Springer, Heidelberg (2013)Google Scholar
- 5.Canny, J.F., Donald, B.R., Ressler, E.K.: A rational rotation method for robust geometric algorithms. In: Proceedings of 8th Annual ACM Symposium on Computational Geometry (SoCG 1992), pp. 251–260. ACM Press, New York (1992)Google Scholar
- 12.Husemöller, D.: Elliptic Curves. Graduate Texts in Mathematics. Springer-Verlag, New York (2003)Google Scholar
- 13.Hwang, F., Richards, D., Winter, P.: The Steiner Tree Problem. Annals of Discrete Mathematics. North-Holland, Amsterdam (1992)Google Scholar
- 14.Kanj, I.A., Xia, G.: Flip distance is in FPT time \(O(n+ k \cdot c^k)\). (2014). http://arxiv.org/abs/1407.1525
- 16.Lawson, C.L.: Software for \(C^1\) surface interpolation. In: Rice, J.R. (ed.) Mathematical Software III, pp. 161–194. Academic Press, New York (1977)Google Scholar
- 18.Lubiw, A., Pathak, V.: Flip distance between two triangulations of a point-set is NP-complete. In: Proceedings of 24th Canadian Conference on Computational Geometry (CCCG), pp. 127–132. CCCG, Charlottetown (2012)Google Scholar
- 21.Shi, W., Su, C.: The rectilinear Steiner arborescence problem is NP-complete. In: Proceedings of 11th Symposium on Discrete Algorithms (SODA), pp. 780–787. SODA, San Francisco (2000)Google Scholar
- 24.Urrutia, J.: Algunos problemas abiertos. In: Proceedings of IX Encuentros de Geometría Computacional, pp. 13–24. Universitat de Girona, Girona (2001)Google Scholar