Abstract
In a recent paper published in this journal, R. Chang and R. Lee purport to devise anO(N logN) time minimal spanning tree algorithm forN points in the plane that is based on a divide-and-conquer strategy using Voronoi diagrams. In this brief note, we present families of problem instances to show that the Chang-Lee worst-case timing analysis is incorrect, resulting in a time bound ofO(N 2 logN). Since it is known that alternate, trulyO(N logN) time algorithms are available anyway, the general utility of the Chang-Lee algorithm is questionable.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R. C. Chang and R. C. T. Lee,An O(N logN)minimal spanning tree algorithm for N points in the plane, BIT 26 (1986), 7–16.
S. A. Cook,A taxonomy of problems with fast parallel algorithms, Information and Control 64 (1985), 2–22.
J. B. Kruskal, Jr.,On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc. 7 (1956), 48–50.
D. T. Lee and B. J. Schachter,Two algorithms for constructing Delaunay triangulations, International Journal of Computer and Information Sciences 9 (1980), 219–242.
M. I. Shamos and D. Hoey,Closest point problems, 16th Annual IEEE Symp. on Foundations of Computer Science (1975), 151–162.
Author information
Authors and Affiliations
Additional information
This author's research is supported in part by the Washington State Technology Center and by the National Science Foundation under grants ECS-8403859 and MIP-8603879.