A History of Flips in Combinatorial Triangulations
Given two combinatorial triangulations, how many edge flips are necessary and sufficient to convert one into the other? This question has occupied researchers for over 75 years. We provide a comprehensive survey, including full proofs, of the various attempts to answer it.
Unable to display preview. Download preview PDF.
- 3.Bose, P., Jansens, D., van Renssen, A., Saumell, M., Verdonschot, S.: Making triangulations 4-connected using flips. In: Proceedings of the 23rd Canadian Conference on Computational Geometry, pp. 241–247 (2011); A full version of this paper can be found at arXiv:1110.6473Google Scholar