论文信息 - On the worst case of a minimal spanning tree algorithm for euclidean space

On the worst case of a minimal spanning tree algorithm for euclidean space

This paper concerns the worst case running time of the minimal spanning tree algorithm presented by Bentley and Friedman.For a set ofN points ink-dimensional Euclidean space the worst case performance of the algorithm is shown to beΘ(N2 logN), fork≧2 andΘ(N2), fork=1.

Jyrki Katajainen

[1] J. Zolnowsky. Topics in computational geometry , 2018 .

[2] Olli Nevalainen,et al. Finding minimal spanning trees in a euclidean coordinate space , 1981, BIT.

[3] Jon Louis Bentley,et al. Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces , 1978, IEEE Transactions on Computers.