Back to Search
Start Over
Flip distance between two triangulations of a point set is NP-complete.
- Source :
-
Computational Geometry . Nov2015, Vol. 49, p17-23. 7p. - Publication Year :
- 2015
-
Abstract
- Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two natural generalizations of the problem are NP-complete, namely computing the minimum number of flips between two triangulations of (1) a polygon with holes; (2) a set of points in the plane. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 09257721
- Volume :
- 49
- Database :
- Academic Search Index
- Journal :
- Computational Geometry
- Publication Type :
- Academic Journal
- Accession number :
- 109884928
- Full Text :
- https://doi.org/10.1016/j.comgeo.2014.11.001