Flip Distance between Triangulations of a Simple Polygon is NP-Complete.

Oswin Aichholzer Wolfgang Mulzer Alexander Pilz

Published in: ESA (2013)

Keyphrases

np complete
simple polygon
randomly generated
np hard
satisfiability problem
convex hull
endpoints
computational complexity
medial axis
learning algorithm
computer vision
lower bound
computationally efficient
polynomial time complexity