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. © 2012 Springer-Verlag.
CITATION STYLE
Bose, P., & Verdonschot, S. (2012). A history of flips in combinatorial triangulations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7579 LNCS, pp. 29–44). https://doi.org/10.1007/978-3-642-34191-5_3
Mendeley helps you to discover research relevant for your work.