24 search results - page 1 / 5 » On the Dilation of Delaunay Triangulations of Points in Conv... |
CCCG
2009
13 years 5 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...
FSTTCS
2007
Springer
13 years 10 months ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
COMGEO
2011
ACM
12 years 11 months ago
2011
ACM
CCCG
2010
13 years 6 months ago
2010
Given a set B of n blue points in general position, we say that a set of red points R blocks B if in the Delaunay triangulation of B R there is no edge connecting two blue points...
WADS
2009
Springer
13 years 11 months ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...