2000 character limit reached
A Bound on the Edge-Flipping Distance between Triangulations (Revisiting the Proof) (2106.14408v1)
Published 28 Jun 2021 in cs.CC
Abstract: We revisit here a fundamental result on planar triangulations, namely that the flip distance between two triangulations is upper-bounded by the number of proper intersections between their straight-segment edges. We provide a complete and detailed proof of this result in a slightly generalised setting using a case-based analysis that fills several gaps left by previous proofs of the result.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.