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

• Flip graphs of bounded degree triangulations
• Constrained paths in the flip-graph of regular triangulations
• Geometric bistellar flips: the setting, the context and a construction
• Flip graphs of bounded-degree triangulations
• Flip graphs of stacked and flag triangulations of the 2-sphere

zbMATH Keywords

graph connectivityMenger's theoremsecondary polytoperegular triangulationbistellar flip graphsimultaneously flippable edges

Mathematics Subject Classification ID

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

Cited In (12)

• Two disjoint 5-holes in point sets
• Connectivity of Triangulation Flip Graphs in the Plane
• Triangulating with high connectivity.
• A point set whose space of triangulations is disconnected
• Algorithm Theory - SWAT 2004
• Title not available (Why is that?)
• 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
• Geometric bistellar flips: the setting, the context and a construction
• Combinatorics. Abstracts from the workshop held January 1--7, 2023
• On Flattenability of Graphs

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)