Connectivity of triangulation flip graphs in the plane

DOI10.1007/s00454-022-00436-2OpenAlexW3013191011MaRDI QIDQ2105329

Uli Wagner, Ermo 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

zbMATH Keywords

graph connectivityMenger's theoremsecondary polytoperegular triangulationbistellar flip graphsimultaneously flippable edges

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) 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) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Connectivity (05C40) Combinatorial complexity of geometric structures (52C45)

Related Items (2)

Two disjoint 5-holes in point sets ⋮ Combinatorics. Abstracts from the workshop held January 1--7, 2023

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the graph structure of convex polyhedra in \(n\)-space
• Two disjoint 5-holes in point sets
• Triangulations. Structures for algorithms and applications
• Konvexe Fünfecke in ebenen Punktmengen
• The number of geometric bistellar neighbors of a triangulation
• Flipping edge-labelled triangulations
• The polytope of non-crossing graphs on a planar point set
• Flipping edges in triangulations
• Enumerating order types for small point sets with applications
• A lower bound on the number of triangulations of planar point sets
• The polytope of all triangulations of a point configuration
• Many non-equivalent realizations of the associahedron
• A proof of the orbit conjecture for flipping edge-labelled triangulations
• Higher-order Erdős-Szekeres theorems
• Transforming triangulations
• Geometry and Topology for Mesh Generation
• Graph Theory
• Counting Plane Graphs: Flippability and Its Applications
• A NOTE ON ORDER‐TYPE HOMOGENEOUS POINT SETS
• Lectures on Polytopes
• Abstract Regular Polytopes
• SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
• Simultaneously Flippable Edges in Triangulations
• A point set whose space of triangulations is disconnected
• Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips)
• Specified holes with pairwise disjoint interiors in planar point sets
• Random lattice triangulations
• Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).

This page was built for publication: Connectivity of triangulation flip graphs in the plane