In this paper we determine the stretch factor of the L1-Delaunay and L∞-Delaunay triangulations, and we show that this stretch is 4 + 2 2 ≈ 2.61. Between any two points x, y of such triangulations, we construct a path whose length is no more than√ 4 + 2 2 times the Euclidean distance between x and y, and this bound is best possible. This definitively improves the 25-year old bound of 10 by Chew (SoCG ’86). To the best of our knowledge, this is the first time the stretch factor of the well-studied Lp-Delaunay triangulations, for any real p ≥ 1, is determined exactly
We study a problem about shortest paths in Delaunay triangulations. Given two nodes s, t in the Dela...
In this paper we show that the θ-graph with 4 cones has constant stretch factor, i.e., there is a pa...
Let P=(p_1, p_2, ..., p_n) be a polygonal chain. The stretch factor of P is the ratio between the to...
In this paper we determine the exact stretch factor of L∞-Delaunay triangulations of points in the p...
In this paper we determine the stretch factor of the $L_1$-Delaunay and $L_\infty$-Delaunay triangul...
Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in whi...
AbstractConsider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph...
Given a set P of n points in the plane and a set S of non-crossing line segments whose endpoints are...
AbstractLet S be a finite set of points in the Euclidean plane. Let G be a geometric graph in the pl...
The problem of computing the exact stretch factor (i.e., the tight bound on the worst case stretch f...
Consider the Delaunay triangulation T of a set P of points in the plane. The spanning ratio of T, i....
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S b...
Spanner construction is a well-studied problem and Delaunay triangulations are among the most popula...
Given a set S of points in the.plane, there is a triangulation of S such that a path found within th...
We study a problem about shortest paths in Delau-nay triangulations. Given two nodes s; t in the De-...
We study a problem about shortest paths in Delaunay triangulations. Given two nodes s, t in the Dela...
In this paper we show that the θ-graph with 4 cones has constant stretch factor, i.e., there is a pa...
Let P=(p_1, p_2, ..., p_n) be a polygonal chain. The stretch factor of P is the ratio between the to...
In this paper we determine the exact stretch factor of L∞-Delaunay triangulations of points in the p...
In this paper we determine the stretch factor of the $L_1$-Delaunay and $L_\infty$-Delaunay triangul...
Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in whi...
AbstractConsider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph...
Given a set P of n points in the plane and a set S of non-crossing line segments whose endpoints are...
AbstractLet S be a finite set of points in the Euclidean plane. Let G be a geometric graph in the pl...
The problem of computing the exact stretch factor (i.e., the tight bound on the worst case stretch f...
Consider the Delaunay triangulation T of a set P of points in the plane. The spanning ratio of T, i....
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S b...
Spanner construction is a well-studied problem and Delaunay triangulations are among the most popula...
Given a set S of points in the.plane, there is a triangulation of S such that a path found within th...
We study a problem about shortest paths in Delau-nay triangulations. Given two nodes s; t in the De-...
We study a problem about shortest paths in Delaunay triangulations. Given two nodes s, t in the Dela...
In this paper we show that the θ-graph with 4 cones has constant stretch factor, i.e., there is a pa...
Let P=(p_1, p_2, ..., p_n) be a polygonal chain. The stretch factor of P is the ratio between the to...