Flip distance and triangulations of a polyhedron

DOI10.1002/JGT.23096zbMATH Open1539.05027MaRDI QIDQ6540258FDOQ6540258

Authors: Zili Wang 

Publication date: 15 May 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

Recommendations

• A combinatorial method to find sharp lower bounds on flip distances
• Computing the flip distance between triangulations
• Publication:4942049

zbMATH Keywords

triangulationpolyhedronflip graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12)

Cites Work

• Triangulations. Structures for algorithms and applications
• P.l. homeomorphic manifolds are equivalent by elementary shellings
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• The associahedron and triangulations of the \(n\)-gon
• Flips in planar graphs
• The diameter of associahedra
• Computing the flip distance between triangulations
• Flip-graph moduli spaces of filling surfaces
• An arc graph distance formula for the flip graph
• The geometry of flip graphs and mapping class groups
• Edge Conflicts do not Determine Geodesics in the Associahedron

This page was built for publication: Flip distance and triangulations of a polyhedron

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