The Stretch Factor of $L_1$- and $L_\infty$-Delaunay Triangulations
Nicolas Bonichon (LaBRI, INRIA Bordeaux - Sud-Ouest), Cyril Gavoille, (LaBRI, INRIA Bordeaux - Sud-Ouest, IUF), Nicolas Hanusse (LaBRI, INRIA, Bordeaux - Sud-Ouest), Ljubomir Perkovic (CTI, SOC)

TL;DR
This paper precisely determines the stretch factor of $L_1$- and $L_$-Delaunay triangulations as approximately 2.61, improving previous bounds and being the first exact calculation for any $L_p$-Delaunay triangulation.
Contribution
It provides the first exact calculation of the stretch factor for $L_p$-Delaunay triangulations for any real $p 1$, improving longstanding bounds.
Findings
Stretch factor is approximately 2.61 for $L_1$- and $L_$-Delaunay triangulations.
This is the first exact determination of the stretch factor for any $L_p$-Delaunay triangulation.
The bound improves the previous 25-year-old bound of . by Chew.
Abstract
In this paper we determine the stretch factor of the -Delaunay and -Delaunay triangulations, and we show that this stretch is . Between any two points of such triangulations, we construct a path whose length is no more than times the Euclidean distance between and , and this bound is best possible. This definitively improves the 25-year old bound of by Chew (SoCG '86). To the best of our knowledge, this is the first time the stretch factor of the well-studied -Delaunay triangulations, for any real , is determined exactly.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Data Management and Algorithms · Point processes and geometric inequalities
