On the Stretch Factor of Convex Delaunay Graphs

Details On the Stretch Factor of Convex Delaunay Graphs On the Stretch Factor of Convex Delaunay Graphs

2008-04-07

arxiv.org/abs/0804.1041v1

Computer Science

Computational Geometry

Scientific paper

Let 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 DG_C(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 DG_C(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 DG_C(S) contains a path between p and q whose Euclidean length is at most t times the Euclidean distance between p and q.

Affiliated with

Also associated with

No associations

Rating

On the Stretch Factor of Convex Delaunay Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Stretch Factor of Convex Delaunay Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Stretch Factor of Convex Delaunay Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-729923