The Community for Technology Leaders
Green Image
Issue No. 02 - February (1978 vol. 27)
ISSN: 0018-9340
pp: 97-105
J.L. Bentley , Department of Computer Science, Carnegie-Mellon University
Algorithms are presented that construct the shortest connecting network, or minimal spanning tree (MST), of N points embedded in k-dimensional coordinate space. These algorithms take advantage of the geometry of such spaces to substantially reduce the computation from that required to construct MST's of more general graphs. An algorithm is also presented that constructs a spanning tree that is very nearly minimal with computation proportional to N log N for all k.
trees., Clustering, communication networks, graphs, minimal spanning trees, shortest connection networks
J.L. Bentley, J.H. Friedman, "Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces", IEEE Transactions on Computers, vol. 27, no. , pp. 97-105, February 1978, doi:10.1109/TC.1978.1675043
115 ms
(Ver 3.1 (10032016))