All triangulations are reachable via sequences of edge-flips: an elementary proof

DOI10.1016/j.cagd.2007.07.002zbMath1172.52301OpenAlexW2143767068MaRDI QIDQ735461

E. Osherovich, Alfred Marcel Bruckstein

Publication date: 22 October 2009

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2007.07.002

zbMATH Keywords

triangulationstriangulations of polygonsedge flipswapping diagonalstriangulations of point sets

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55)

Related Items (2)

Flip paths between lattice triangulations ⋮ Flip distance between two triangulations of a point set is NP-complete

Cites Work

• Unnamed Item
• Transforming triangulations in polygonal domains
• Transforming triangulations
• Polygons Have Ears

This page was built for publication: All triangulations are reachable via sequences of edge-flips: an elementary proof