AI Chat AI Image Generator AI Video Text to Speech

A Short Proof of the Toughness of Delaunay Triangulations

07/02/2019

∙

by Ahmad Biniaz, et al.

∙

∙

We present a self-contained short proof of the seminal result of Dillencourt (SoCG 1987 and DCG 1990) that Delaunay triangulations, of planar point sets in general position, are 1-tough. An important implication of this result is that Delaunay triangulations have perfect matchings.

page 1

page 2

page 3

research

∙ 10/11/2019

A Proof of Levi's Extension Lemma

We give a short and self-contained proof of Levi's Extension Lemma for p...

0 Marcus Schaefer, et al. ∙

research

∙ 08/20/2020

A Simple Proof of Optimal Approximations

The fundamental result of Li, Long, and Srinivasan on approximations of ...

0 Monika Csikos, et al. ∙

research

∙ 05/17/2018

Short Combinatorial Proof that the DFJ Polytope is contained in the MTZ Polytope for the Asymmetric Traveling Salesman Problem

For the Asymmetric Traveling Salesman Problem (ATSP), it is known that t...

0 Mark Velednitsky, et al. ∙

research

∙ 06/28/2021

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

We revisit here a fundamental result on planar triangulations, namely th...

0 Thomas Dagès, et al. ∙

research

∙ 10/20/2020

The Elliptical Potential Lemma Revisited

This note proposes a new proof and new perspectives on the so-called Ell...

0 Alexandra Carpentier, et al. ∙

research

∙ 10/02/2020

Note: An alternative proof of the vulnerability of k-NN classifiers in high intrinsic dimensionality regions

This document proposes an alternative proof of the result contained in a...

0 Teddy Furon, et al. ∙

research

∙ 08/02/2020

Extendability of simplicial maps is undecidable

We present a short proof of the Čadek-Krčál-Matoušek-Vokřínek-Wagner res...

0 A. Skopenkov, et al. ∙