The Delaunay triangulation closely approximates the complete Euclidean graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 382 LNCS, Issue , 1989, Pages 47-56

  Keil, J Mark ^a   Gutwin, Carl A ^a  

^a UNIVERSITY OF SASKATCHEWAN   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; TRIANGULATION;

DELAU-NAY TRIANGULATIONS; EUCLIDEAN DISTANCE; EUCLIDEAN GRAPH; SHORTEST PATH;

SURVEYING;

EID: 84976713672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51542-9_6     Document Type: Conference Paper

References (5)

1. Chew, P., There is a planar graph almost as good as the complete graph, Proceedings of the 2nd Symposium on Computational Geometry, Yorktown Heights NY, 1986, 169–177.
2. Dobkin, D., S. Friedman and K. Supowit, Delaunay Graphs are Almost as Good as Complete Graphs, Proceedings of the 28th Annual Symposium on Foundations of Computing, Los Angeles Ca., 1987, 20–26.
3. Keil J.M., Approximating the Complete Euclidean Graph, Proceedings of the First Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 1988, Springer-Verlag Lecture Notes in Computer Science No. 318, 208–213.
4. Preparata, F. and M. Shamos, Computational Geometry: an Introduction, Springer-Verlag, 1985.
5. Sedgewick, R. and J. Vitter, Shortest paths in Euclidean graphs, Algorithmica, 1,1(1986), 31–48.