Connectivity of triangulation flip graphs in the plane
DOI10.1007/S00454-022-00436-2OpenAlexW3013191011MaRDI QIDQ2105329FDOQ2105329
Authors: Uli Wagner, Emo Welzl 
Publication date: 8 December 2022
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.13557
Recommendations
graph connectivityMenger's theoremsecondary polytoperegular triangulationbistellar flip graphsimultaneously flippable edges
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Connectivity (05C40) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A lower bound on the number of triangulations of planar point sets
- A note on order-type homogeneous point sets
- A point set whose space of triangulations is disconnected
- A proof of the orbit conjecture for flipping edge-labelled triangulations
- Abstract Regular Polytopes
- Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips)
- Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).
- Enumerating order types for small point sets with applications
- Flipping edge-labelled triangulations
- Flipping edges in triangulations
- Geometry and topology for mesh generation
- Graph theory
- Higher-order Erdős-Szekeres theorems
- Konvexe Fünfecke in ebenen Punktmengen
- Lectures on Polytopes
- Many non-equivalent realizations of the associahedron
- On the graph structure of convex polyhedra in \(n\)-space
- Random lattice triangulations: structure and algorithms
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
- Simultaneously flippable edges in triangulations
- Specified holes with pairwise disjoint interiors in planar point sets
- The number of geometric bistellar neighbors of a triangulation
- The polytope of all triangulations of a point configuration
- The polytope of non-crossing graphs on a planar point set
- Transforming triangulations
- Triangulations. Structures for algorithms and applications
- Two disjoint 5-holes in point sets
Cited In (19)
- Two disjoint 5-holes in point sets
- Connectivity of Triangulation Flip Graphs in the Plane
- Triangulating with high connectivity.
- Flip graphs of stacked and flag triangulations of the 2-sphere
- A point set whose space of triangulations is disconnected
- Algorithm Theory - SWAT 2004
- Title not available (Why is that?)
- Flip graphs of bounded degree triangulations
- Lifting simplicial complexes to the boundary of convex polytopes
- Flip graphs of bounded-degree triangulations
- The polytope of non-crossing graphs on a planar point set
- Constrained paths in the flip-graph of regular triangulations
- The flip-graph of the 4-dimensional cube is connected
- Flip-connectivity of triangulations of the product of a tetrahedron and simplex
- Geometric bistellar flips: the setting, the context and a construction
- Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).
- Combinatorics. Abstracts from the workshop held January 1--7, 2023
- On Flattenability of Graphs
- A result on flip-graph connectivity
This page was built for publication: Connectivity of triangulation flip graphs in the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105329)
