TY - GEN

T1 - On the stretch factor of convex delaunay graphs

AU - Bose, Prosenjit

AU - Carmi, Paz

AU - Collette, Sébastien

AU - Smid, Michiel

PY - 2008/12/1

Y1 - 2008/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=58549088552&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-92182-0_58

DO - 10.1007/978-3-540-92182-0_58

M3 - Conference contribution

AN - SCOPUS:58549088552

SN - 3540921818

SN - 9783540921813

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 656

EP - 667

BT - Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings

T2 - 19th International Symposium on Algorithms and Computation, ISAAC 2008

Y2 - 15 December 2008 through 17 December 2008

ER -