Related papers: Happy endings for flip graphs
We associate to triangulations of infinite type surface a type of flip graph where simultaneous flips are allowed. Our main focus is on understanding exactly when two triangulations can be related by a sequence of flips. A consequence of…
In this work we consider triangulations of point sets in the Euclidean plane, i.e., maximal straight-line crossing-free graphs on a finite set of points. Given a triangulation of a point set, an edge flip is the operation of removing one…
We study flip graphs of triangulations whose maximum vertex degree is bounded by a constant $k$. In particular, we consider triangulations of sets of $n$ points in convex position in the plane and prove that their flip graph is connected if…
Given two triangulations of a convex polygon, computing the minimum number of flips required to transform one to the other is a long-standing open problem. It is not known whether the problem is in P or NP-complete. We prove that two…
Flip-graph connectedness is established here for the vertex set of the 4-dimensional cube. It is found as a consequence that this vertex set has 92 487 256 triangulations, partitioned into 247 451 symmetry classes.
Flip graphs are a ubiquitous class of graphs, which encode relations induced on a set of combinatorial objects by elementary, local changes. Skeletons of associahedra, for instance, are the graphs induced by quadrilateral flips in…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…
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…
We consider geometric triangulations of surfaces, i.e., triangulations whose edges can be realized by disjoint locally geodesic segments. We prove that the flip graph of geometric triangulations with fixed vertices of a flat torus or a…
Let T be a triangulation of a simple polygon. A flip in T is the operation of removing one diagonal of T and adding a different one such that the resulting graph is again a triangulation. The flip distance between two triangulations is the…
The flip graph for a set $P$ of points in the plane has a vertex for every triangulation of $P$, and an edge when two triangulations differ by one flip that replaces one triangulation edge by another. The flip graph is known to have some…
A (multi)set of segments in the plane may form a TSP tour, a matching, a tree, or any multigraph. If two segments cross, then we can reduce the total length with the following flip operation. We remove a pair of crossing segments, and…
Flips of diagonals in colored triangle-free triangulations of a convex polygon are interpreted as moves between two adjacent chambers in a certain graphic hyperplane arrangement. Properties of geodesics in the associated flip graph are…
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…
A triangulation of a polygon is a subdivision of it into triangles, using diagonals between its vertices. Two different triangulations of a polygon can be related by a sequence of flips: a flip replaces a diagonal by the unique other…
Let ${\cal T}$ be a triangulation of a set ${\cal P}$ of $n$ points in the plane, and let $e$ be an edge shared by two triangles in ${\cal T}$ such that the quadrilateral $Q$ formed by these two triangles is convex. A {\em flip} of $e$ is…
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to improve the upper bound on the number of Steiner points needed to obtain compatible triangulations of point sets.…
Flips in triangulations have received a lot of attention over the past decades. However, the problem of tracking where particular edges go during the flipping process has not been addressed. We examine this question by attaching unique…
We prove that for a given flat surface with conical singularities, any pair of geometric triangulations can be connected by a chain of flips.