Once punctured disks, non-convex polygons, and pointihedra
From MaRDI portal
Publication:1787972
Abstract: We explore several families of flip-graphs, all related to polygons or punctured polygons. In particular, we consider the topological flip-graphs of once-punctured polygons which, in turn, contain all possible geometric flip-graphs of polygons with a marked point as embedded sub-graphs. Our main focus is on the geometric properties of these graphs and how they relate to one another. In particular, we show that the embeddings between them are strongly convex (or, said otherwise, totally geodesic). We also find bounds on the diameters of these graphs, sometimes using the strongly convex embeddings. Finally, we show how these graphs relate to different polytopes, namely type D associahedra and a family of secondary polytopes which we call pointihedra.
Recommendations
Cites work
- scientific article; zbMATH DE number 5874 (Why is no real title available?)
- Flip-graph moduli spaces of filling surfaces
- Flipping edges in triangulations
- Graph of triangulations of a convex polygon and tree of triangulations
- Injective maps between flip graphs
- Modular flip-graphs of one-holed surfaces
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- The associahedron and triangulations of the \(n\)-gon
- The diameter of associahedra
- The diameter of type \(D\) associahedra and the non-leaving-face property
- The geometry of flip graphs and mapping class groups
- The rotation graph of binary trees is Hamiltonian
- Triangulations. Structures for algorithms and applications
Cited in
(4)
This page was built for publication: Once punctured disks, non-convex polygons, and pointihedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1787972)