Flip Distance of Convex Triangulations and Tree Rotation Is NP-Complete

Automated excerpt

Geom. 2014] proved that computing the flip distance between triangulations of point sets in general position is NP-complete. Further, Aichholzer, Mulzer, and Pilz [ESA 2013, DCG 2015] proved that computing the flip distance between triangulations of simple polygons is NP-complete. We formulate a notion of conflict graphs for flip sequences between triangulations of convex polygons that allows us to use both geometric and combinatorial tools to study flip sequences.

Selected automatically from source text; not independently written or fact-checked. Read the original for full context.