Flip distance and triangulations of a polyhedron
From MaRDI portal
Publication:6540258
DOI10.1002/JGT.23096zbMATH Open1539.05027MaRDI QIDQ6540258
Publication date: 15 May 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)
Cites Work
- P.l. homeomorphic manifolds are equivalent by elementary shellings
- Flips in planar graphs
- Triangulations. Structures for algorithms and applications
- The associahedron and triangulations of the \(n\)-gon
- Flip-graph moduli spaces of filling surfaces
- Computing the flip distance between triangulations
- The diameter of associahedra
- An arc graph distance formula for the flip graph
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Edge Conflicts do not Determine Geodesics in the Associahedron
- The geometry of flip graphs and mapping class groups
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)
