Transforming plane triangulations by simultaneous diagonal flips

DOI10.1016/j.ipl.2021.106120OpenAlexW3025226084MaRDI QIDQ2032161

Tanvir Kaykobad, Jean-Lou De Carufel

Publication date: 16 June 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10393/40499

zbMATH Keywords

combinatorial problemsanalysis of algorithmsgraph algorithmscomputational geometry

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Flip paths between lattice triangulations

Cites Work

• Unnamed Item
• Flip distance between two triangulations of a point set is NP-complete
• Flips in planar graphs
• Arc diagrams, flip distances, and Hamiltonian triangulations
• Flipping edge-labelled triangulations
• Diagonal flips in plane graphs with triangular and quadrangular faces
• Computing the flip distance between triangulations
• A proof of the orbit conjecture for flipping edge-labelled triangulations
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• A History of Flips in Combinatorial Triangulations
• Graph-Theoretic Concepts in Computer Science
• Simultaneous diagonal flips in plane triangulations
• Diagonal flips in labelled planar triangulations

This page was built for publication: Transforming plane triangulations by simultaneous diagonal flips