A History of Flips in Combinatorial Triangulations
classification
💻 cs.CG
keywords
combinatorialflipstriangulationsanswerattemptscomprehensiveconvertedge
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.