Add to ORKGLet C be a compact and convex set in the plane that contains the origin in its interior, and let S be a finite set of points in the plane. The Delaunay graph DGC(S) of S is defined to be the dual of the Voronoi diagram of S with respect to the convex distance function defined by C .We prove that DGC(S) is a t-spanner for S, for some constant t that depends only on the shape of the set C .Thus, for any two points p and q in S, the graph DGC(S) contains a path between p and q whose Euclidean length is at most t times the Euclidean distance between p and q.http://jocg.org/index.php/jocg/article/view/5/9info:eu-repo/semantics/publishe
Let $\mathcal{P}$ be a set of $n$ points embedded in the plane, and let $\mathcal{C}$ be the complet...
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which...
Given an arbitrary convex shape C, a set P of points in the plane and a set S of line segments whose...
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S b...
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...
AbstractLet S be a finite set of points in the Euclidean plane. Let G be a geometric graph in the pl...
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which...
We look at generalized Delaunay graphs in the con-strained setting by introducing line segments whic...
Given a set P of n points in the plane and a set S of non-crossing line segments whose endpoints are...
In this paper we determine the stretch factor of the L1-Delaunay and L∞-Delaunay triangulations, and...
In this paper we determine the exact stretch factor of L∞-Delaunay triangulations of points in the p...
In this paper we show that the θ-graph with 4 cones has constant stretch factor, i.e., there is a pa...
Let P be a set of n points and Q a convex k-gon in R2. We analyze in detail the topological (or disc...
AbstractWe study the problem of computing geometric spanners for (additively) weighted point sets. A...
Let $\mathcal{P}$ be a set of $n$ points embedded in the plane, and let $\mathcal{C}$ be the complet...
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which...
Given an arbitrary convex shape C, a set P of points in the plane and a set S of line segments whose...
Let C be a compact and convex set in the plane that contains the origin in its interior, and let S b...
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...
AbstractLet S be a finite set of points in the Euclidean plane. Let G be a geometric graph in the pl...
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which...
We look at generalized Delaunay graphs in the con-strained setting by introducing line segments whic...
Given a set P of n points in the plane and a set S of non-crossing line segments whose endpoints are...
In this paper we determine the stretch factor of the L1-Delaunay and L∞-Delaunay triangulations, and...
In this paper we determine the exact stretch factor of L∞-Delaunay triangulations of points in the p...
In this paper we show that the θ-graph with 4 cones has constant stretch factor, i.e., there is a pa...
Let P be a set of n points and Q a convex k-gon in R2. We analyze in detail the topological (or disc...
AbstractWe study the problem of computing geometric spanners for (additively) weighted point sets. A...
Let $\mathcal{P}$ be a set of $n$ points embedded in the plane, and let $\mathcal{C}$ be the complet...
We look at generalized Delaunay graphs in the constrained setting by introducing line segments which...
Given an arbitrary convex shape C, a set P of points in the plane and a set S of line segments whose...