Spanner construction is a well-studied problem and Delaunay triangulations are among the most popular spanners. Tight bounds are known if the Delaunay triangulation is constructed using an equilateral triangle, a square, or a regular hexagon. However, all other shapes have remained elusive. In this paper we extend the restricted class of spanners for which tight bounds are known. We prove that Delaunay triangulations constructed using rectangles with aspect ratio $\A$ have spanning ratio at most $\sqrt{2} \sqrt{1+\A^2 + \A \sqrt{\A^2 + 1}}$, which matches the known lower bound
Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in whi...
In this paper we determine the exact stretch factor of L∞-Delaunay triangulations of points in the p...
Given a triangulation G, whose vertex set V is a set of n points in the plane, and given a real numb...
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....
AbstractConsider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph...
AbstractLet S be a finite set of points in the Euclidean plane. Let G be a geometric graph in the pl...
We describe an algorithm that builds a plane spanner with a maximum degree of 8 and a spanning ratio...
In this paper we determine the stretch factor of the $L_1$-Delaunay and $L_\infty$-Delaunay triangul...
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which...
Given a set P of n points in the plane, we show how to compute in O(nlogn) time a spanning subgraph ...
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which...
Let P be a set of n points embedded in the plane, and let C be the complete Euclidean graph whose po...
Given a set P of n points in the plane, we show how to compute in O(n logn) time a subgraph of their...
We provide improved upper bounds on the spanning ratio of various geometric graphs, one of which bei...
Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in whi...
In this paper we determine the exact stretch factor of L∞-Delaunay triangulations of points in the p...
Given a triangulation G, whose vertex set V is a set of n points in the plane, and given a real numb...
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....
AbstractConsider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph...
AbstractLet S be a finite set of points in the Euclidean plane. Let G be a geometric graph in the pl...
We describe an algorithm that builds a plane spanner with a maximum degree of 8 and a spanning ratio...
In this paper we determine the stretch factor of the $L_1$-Delaunay and $L_\infty$-Delaunay triangul...
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which...
Given a set P of n points in the plane, we show how to compute in O(nlogn) time a spanning subgraph ...
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which...
Let P be a set of n points embedded in the plane, and let C be the complete Euclidean graph whose po...
Given a set P of n points in the plane, we show how to compute in O(n logn) time a subgraph of their...
We provide improved upper bounds on the spanning ratio of various geometric graphs, one of which bei...
Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in whi...
In this paper we determine the exact stretch factor of L∞-Delaunay triangulations of points in the p...
Given a triangulation G, whose vertex set V is a set of n points in the plane, and given a real numb...