AI Chat AI Image Generator AI Video Text to Speech

A Bound on the Edge-Flipping Distance between Triangulations (Revisiting the Proof)

06/28/2021

∙

by Thomas Dagès, et al.

∙

∙

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.

Thomas Dagès
5 publications
Alfred M. Bruckstein
35 publications

research

∙ 04/25/2021

Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest

1-planar graphs are graphs that can be drawn in the plane such that any ...

0 Sam Barr, et al. ∙

research

∙ 07/02/2019

A Short Proof of the Toughness of Delaunay Triangulations

We present a self-contained short proof of the seminal result of Dillenc...

0 Ahmad Biniaz, et al. ∙

research

∙ 06/11/2020

An improved constant factor for the unit distance problem

We prove that the number of unit distances among n planar points is at m...

0 Péter Ágoston, et al. ∙

research

∙ 06/22/2022

Dispersing Obnoxious Facilities on Graphs by Rounding Distances

We continue the study of δ-dispersion, a continuous facility location pr...

0 Tim A. Hartmann, et al. ∙

research

∙ 12/16/2022

Antichain Codes

A family of sets A is said to be an antichain if x⊄y for all distinct x,...

0 Benjamin Gunby, et al. ∙

research

∙ 10/12/2021

Improved Analysis of EDCS via Gallai-Edmonds Decomposition

In this note, we revisit the edge-degree constrained subgraph (EDCS) int...

0 Soheil Behnezhad, et al. ∙

research

∙ 11/15/2022

A Probabilistic Proof of the nCPA to CCA Bound

We provide a new proof of Maurer, Renard, and Pietzak's bound of the CCA...

0 Ben Morris, et al. ∙