Abstract
Let S be a set ofn points in the plane. For an arbitrary positive rationalr, we construct a planar straight-line graph onS that approximates the complete Euclidean graph onS within the factor (1 + 1/r)[2π/3 cos(π/6)], and it has length bounded by 2r + 1 times the length of a minimum Euclidean spanning tree onS. Given the Deiaunay triangulation ofS, the graph can be constructed in linear time.
Similar content being viewed by others
References
A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
M. W. Bern and R. L. Graham, The shortest-network problem,Scientific American, January 1989.
L. P. Chew, There is a planar graph almost as good as the complete graph,Proceedings of the 2nd Annual ACM Symposium on Computational Geometry, Yorktown Heights, 1986.
G. Das and D. Joseph, Which triangulations approximate the complete graph?,Proceedings of the International Symposium on Optimal Algorithms, Varna, Bulgaria, 1989. Lecture Notes in Computer Science, Vol. 401, pp. 9–13, Springer-Verlag, Berlin.
D. Cheriton and R. E. Tarjan, Finding minimum spanning trees.SIAM J. Comput.,5 (1976), 724–742.
D. P. Dobkin, S. J. Friedman, and K. J. Supowit, Delaunay graphs are almost as good as complete graphs,Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, 1987.
M. Keil, Approximating the complete Euclidean graph,Proceedings of the 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, 1988.
M. Keil and C. Gutwin, The Delaunay triangulation closely approximates the complete Euclidean graph,Proceedings of the 1st Canadian Workshop on Algorithms and Data Structures, Ottawa, August 1989.
D. G. Kirkpatrick, A note on Delaunay and optimal triangulations,Inform. Process. Lett. 10, No. 3 (1980), 127–131.
F. P. Preparata and M. I. Shamos,Computational Geometry, An Introduction, Texts and Monographs in Computer Science, Springer-Verlag, New York, 1985.
Author information
Authors and Affiliations
Additional information
Communicated by Greg. N. Frederickson.
Rights and permissions
About this article
Cite this article
Levcopoulos, C., Lingas, A. There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees. Algorithmica 8, 251–256 (1992). https://doi.org/10.1007/BF01758846
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01758846