2000 character limit reached
A History of Flips in Combinatorial Triangulations (1206.0303v2)
Published 1 Jun 2012 in cs.CG
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.