8 search results - page 1 / 2 » On the Stretch Factor of Convex Delaunay Graphs |
74
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
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 define...
CCCG
2009
14 years 10 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
65
Voted
COMGEO
2011
ACM
14 years 4 months ago
2011
ACM
94
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...
115
click to vote
SMA
2009
ACM
15 years 4 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...