The Stretch Factor of Hexagon-Delaunay Triangulations

10/31/2017
by   Michael Dennis, et al.
0

The problem of computing the exact stretch factor (i.e., the tight bound on the worst case stretch factor) of a Delaunay triangulation has been open for more than three decades. Over the years, a series of upper and lower bounds on the exact stretch factor have been obtained but the gap between them is still large. An alternative approach to solving the problem is to develop techniques for computing the exact stretch factor of "easier" types of Delaunay triangulations, in particular those defined using regular-polygons instead of a circle. Tight bounds exist for Delaunay triangulations defined using an equilateral triangle and a square. In this paper, we determine the exact stretch factor of Delaunay triangulations defined using a hexagon instead of a circle: It is 2. We think that the techniques we have developed may prove useful in future work on computing the exact stretch factor of classical Delaunay triangulations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2013

Computing Upper and Lower Bounds on Likelihoods in Intractable Networks

We present deterministic techniques for computing upper and lower bounds...
research
11/22/2022

The Tight Spanning Ratio of the Rectangle Delaunay Triangulation

Spanner construction is a well-studied problem and Delaunay triangulatio...
research
03/21/2020

Covering the Relational Join

In this paper, we initiate a theoretical study of what we call the join ...
research
04/03/2019

Exact Lower Bounds for Monochromatic Schur Triples and Generalizations

We derive exact and sharp lower bounds for the number of monochromatic g...
research
08/03/2023

Tight Bounds for Local Glivenko-Cantelli

This paper addresses the statistical problem of estimating the infinite-...
research
05/18/2023

Improved and Partially-Tight Lower Bounds for Message-Passing Implementations of Multiplicity Queues

A multiplicity queue is a concurrently-defined data type which relaxes t...
research
06/16/2020

Debona: Decoupled Boundary Network Analysis for Tighter Bounds and Faster Adversarial Robustness Proofs

Neural networks are commonly used in safety-critical real-world applicat...

Please sign up or login with your details

Forgot password? Click here to reset