A Bound on the Edge-Flipping Distance between Triangulations (Revisiting the Proof)
Computational Complexity
2021-06-29 v1
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.
Keywords
Cite
@article{arxiv.2106.14408,
title = {A Bound on the Edge-Flipping Distance between Triangulations (Revisiting the Proof)},
author = {Thomas Dagès and Alfred M. Bruckstein},
journal= {arXiv preprint arXiv:2106.14408},
year = {2021}
}