Abstract
Let p and q be a pair of points in a set S of N points in the plane. Let d(p,q) be the Euclidean distance between p and q and let DT(p,q) be the length of the shortest path from p to q in the Delaunay triangulation of S. We show that that the ratio (Formula presented) independent of S and N.
Cite
CITATION STYLE
APA
Keil, J. M., & Gutwin, C. A. (1989). The Delaunay triangulation closely approximates the complete Euclidean graph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 382 LNCS, pp. 47–56). Springer Verlag. https://doi.org/10.1007/3-540-51542-9_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free