DocumentCode
2185731
Title
Delaunay graphs are almost as good as complete graphs
Author
Dobkin, David P. ; Friedman, Steven J. ; Supowit, Kenneth J.
fYear
1987
fDate
12-14 Oct. 1987
Firstpage
20
Lastpage
26
Abstract
Let S be any set of N points in the plane and let DT(S) be the graph of the Delaunay triangulation of S. For all points a and b of S, let d(a, b) be the Euclidean distance from a to b and let DT(a, b) be the length of the shortest path in DT(S) from a to b. We show that there is a constant c(≤ 1+√5/2 π ≈ 5.08) independent of S and N such that DT(a, b)/d(a, b) ≪ c.
Keywords
Computer science; Data structures; Euclidean distance; Joining processes; Scholarships; Spine; Transportation; Tree data structures; Tree graphs; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1987., 28th Annual Symposium on
Conference_Location
Los Angeles, CA, USA
ISSN
0272-5428
Print_ISBN
0-8186-0807-2
Type
conf
DOI
10.1109/SFCS.1987.18
Filename
4568252
Link To Document