On the stretch factor of convex Delaunay graphs

Authors

  • Prosenjit Bose Carleton University
  • Paz Carmi Ben-Gurion University of the Negev
  • Sebastien Collette Universite Libre de Bruxelles
  • Michiel Smid Carleton Universtity

DOI:

https://doi.org/10.20382/jocg.v1i1a4

Abstract

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 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.

Downloads

Download data is not yet available.

Author Biography

Sebastien Collette, Universite Libre de Bruxelles

Charge de Recherches du FNRS.

Downloads

Published

2010-06-11

Issue

Vol. 1 No. 1 (2010)

Section

Articles

License

Authors who publish with this journal agree to the following terms:

Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).