Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips)

DOI10.1137/1.9781611975994.172MaRDI QIDQ5146969zbMATH OpenOpenAlexFDO

Authors Emo Welzl

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611975994.172

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Connectivity of triangulation flip graphs in the plane
• Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).
• Flip graphs of bounded degree triangulations
• Flip graphs of bounded-degree triangulations
• Flipping edges in triangulations

Cited in

(5)

• Flips in higher order Delaunay triangulations
• Connectivity of triangulation flip graphs in the plane
• Minimum number of partial triangulations
• Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).
• On signed diagonal flip sequences

This page was built for publication: Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146969)