# A proof of the orbit conjecture for flipping edge-labelled triangulations

A. Lubiw, Z. Masárová, U. Wagner, Discrete & Computational Geometry 61 (2019) 880–898.

Download

2018_DiscreteGeometry_Lubiw.pdf
556.28 KB

*Journal Article*|

*Published*|

*English*

**Scopus indexed**

Author

Department

Abstract

Given a triangulation of a point set in the plane, a flip deletes an edge e whose removal leaves a convex quadrilateral, and replaces e by the opposite diagonal of the quadrilateral. It is well known that any triangulation of a point set can be reconfigured to any other triangulation by some sequence of flips. We explore this question in the setting where each edge of a triangulation has a label, and a flip transfers the label of the removed edge to the new edge. It is not true that every labelled triangulation of a point set can be reconfigured to every other labelled triangulation via a sequence of flips, but we characterize when this is possible. There is an obvious necessary condition: for each label l, if edge e has label l in the first triangulation and edge f has label l in the second triangulation, then there must be some sequence of flips that moves label l from e to f, ignoring all other labels. Bose, Lubiw, Pathak and Verdonschot formulated the Orbit Conjecture, which states that this necessary condition is also sufficient, i.e. that all labels can be simultaneously mapped to their destination if and only if each label individually can be mapped to its destination. We prove this conjecture. Furthermore, we give a polynomial-time algorithm (with 𝑂(𝑛8) being a crude bound on the run-time) to find a sequence of flips to reconfigure one labelled triangulation to another, if such a sequence exists, and we prove an upper bound of 𝑂(𝑛7) on the length of the flip sequence. Our proof uses the topological result that the sets of pairwise non-crossing edges on a planar point set form a simplicial complex that is homeomorphic to a high-dimensional ball (this follows from a result of Orden and Santos; we give a different proof based on a shelling argument). The dual cell complex of this simplicial ball, called the flip complex, has the usual flip graph as its 1-skeleton. We use properties of the 2-skeleton of the flip complex to prove the Orbit Conjecture.

Publishing Year

Date Published

2019-06-01

Journal Title

Discrete & Computational Geometry

Volume

61

Issue

4

Page

880-898

IST-REx-ID

### Cite this

Lubiw A, Masárová Z, Wagner U. A proof of the orbit conjecture for flipping edge-labelled triangulations.

*Discrete & Computational Geometry*. 2019;61(4):880-898. doi:10.1007/s00454-018-0035-8Lubiw, A., Masárová, Z., & Wagner, U. (2019). A proof of the orbit conjecture for flipping edge-labelled triangulations.

*Discrete & Computational Geometry*,*61*(4), 880–898. https://doi.org/10.1007/s00454-018-0035-8Lubiw, Anna, Zuzana Masárová, and Uli Wagner. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.”

*Discrete & Computational Geometry*61, no. 4 (2019): 880–98. https://doi.org/10.1007/s00454-018-0035-8.A. Lubiw, Z. Masárová, and U. Wagner, “A proof of the orbit conjecture for flipping edge-labelled triangulations,”

*Discrete & Computational Geometry*, vol. 61, no. 4, pp. 880–898, 2019.Lubiw A, Masárová Z, Wagner U. 2019. A proof of the orbit conjecture for flipping edge-labelled triangulations. Discrete & Computational Geometry. 61(4), 880–898.

Lubiw, Anna, et al. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.”

*Discrete & Computational Geometry*, vol. 61, no. 4, Springer Nature, 2019, pp. 880–98, doi:10.1007/s00454-018-0035-8.**All files available under the following license(s):**

**Creative Commons Attribution 4.0 International Public License (CC-BY 4.0):**

**Main File(s)**

File Name

2018_DiscreteGeometry_Lubiw.pdf
556.28 KB

Access Level

Open Access

Date Uploaded

2019-02-14

MD5 Checksum

e1bff88f1d77001b53b78c485ce048d7

**Material in IST:**

**Dissertation containing IST record**

**Earlier Version**

### Export

Marked PublicationsOpen Data IST Research Explorer

### Sources

arXiv 1710.02741