We examine reconfigurations between triangulations and near-triangulations of point sets. We give new bounds on the number of point moves and edge flips sufficient for any reconfiguration. We show that with O(n log n) edge flips and point moves, we can transform any geometric near-triangulation on n points to any other geometric near-triangulation on n possibly different points. This improves the previously known bound of O(n 2) edge flips and point moves. We then show that with a slightly more general point move, we can further reduce the complexity to O(n) point moves and edge flips.

Additional Metadata
Keywords Diagonal flips, Edge flip, Point move, Reconfigure, Triangulation
Persistent URL dx.doi.org/10.1007/s00453-006-0168-7
Journal Algorithmica
Aloupis, G, Bose, P, & Morin, P. (2007). Reconfiguring triangulations with edge flips and point moves. In Algorithmica (Vol. 47, pp. 367–378). doi:10.1007/s00453-006-0168-7