On the stretch factor of convex delaunay graphs

Prosenjit Bose, Paz Carmi, Sébastien Collette, Michiel Smid

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations


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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings
Number of pages12
StatePublished - 1 Dec 2008
Externally publishedYes
Event19th International Symposium on Algorithms and Computation, ISAAC 2008 - Gold Coast, QLD, Australia
Duration: 15 Dec 200817 Dec 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5369 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference19th International Symposium on Algorithms and Computation, ISAAC 2008
CityGold Coast, QLD

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)


Dive into the research topics of 'On the stretch factor of convex delaunay graphs'. Together they form a unique fingerprint.

Cite this