Computer Science – Computational Geometry
Scientific paper
2010-06-02
Computer Science
Computational Geometry
12 pages, 6 figures, invited to the special edition of Computational Geometry Theory and Applications for papers from CCCG 200
Scientific paper
Consider the Delaunay triangulation T of a set P of points in the plane as a Euclidean graph, in which the weight of every edge is its length. It has long been conjectured that the dilation in T of any pair p, p \in P, which is the ratio of the length of the shortest path from p to p' in T over the Euclidean distance ||pp'||, can be at most {\pi}/2 \approx 1.5708. In this paper, we show how to construct point sets in convex position with dilation > 1.5810 and in general position with dilation > 1.5846. Furthermore, we show that a sufficiently large set of points drawn independently from any distribution will in the limit approach the worst-case dilation for that distribution.
Bose Prosenjit
Devroye Luc
Löffler Maarten
Snoeyink Jack
Verma Vishal
No associations
LandOfFree
The dilation of the Delaunay triangulation is greater than π/2 does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The dilation of the Delaunay triangulation is greater than π/2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The dilation of the Delaunay triangulation is greater than π/2 will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-512431