On the Stretch Factor of Convex Delaunay Graphs
| dc.creator | Bose, Prosenjit | |
| dc.creator | Carmi, Paz | |
| dc.creator | Collette, Sebastien | |
| dc.creator | Smid, Michiel | |
| dc.date | 2008-04-07 | |
| dc.date.accessioned | 2026-07-07T09:30:50Z | |
| dc.date.available | 2026-07-07T09:30:50Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0804.1041 | |
| dc.identifier | http://arxiv.org/abs/0804.1041 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/158249 | |
| dc.subject | Computational Geometry | |
| dc.title | On the Stretch Factor of Convex Delaunay Graphs | |
| dc.type | text |