Flip paths between lattice triangulations

DOI10.1016/j.dam.2023.07.027zbMath1526.05104arXiv2008.11292OpenAlexW3081041449MaRDI QIDQ6090067

William Sims, Sitharam, Meera

Publication date: 13 November 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.11292

zbMATH Keywords

Farey sequencelattice triangulationsdiagonal flip pathsshortest flip path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• All triangulations are reachable via sequences of edge-flips: an elementary proof
• Flip distance between triangulations of a simple polygon is NP-complete
• Triangulations. Structures for algorithms and applications
• Transforming triangulations in polygonal domains
• Diagonal flips in triangulations of surfaces
• Flipping edges in triangulations
• Transforming plane triangulations by simultaneous diagonal flips
• Random lattice triangulations: structure and algorithms
• Wagner's theorem for torus graphs
• Transforming triangulations
• Diagonal transformations of triangulation on surfaces
• Bemerkungen zum Vierfarbenproblem
• Happy endings for flip graphs
• SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
• Farey series and the Riemann hypothesis
• Simultaneously Flippable Edges in Triangulations
• Simultaneous diagonal flips in plane triangulations

This page was built for publication: Flip paths between lattice triangulations