Sciweavers

2 search results - page 1 / 1
» Lower Bounds on the Dilation of Plane Spanners
Sort
View
CCCG
2009
13 years 5 months ago
On the Dilation of Delaunay Triangulations of Points in Convex Position
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...
Shiliang Cui, Iyad A. Kanj, Ge Xia
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
13 years 11 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon