AnO(N logN) minimal spanning tree algorithm forN points in the plane

This publication has 10 references indexed in Scilit:

• Optimal speeding up of parallel algorithms based upon the divide-and-conquer strategy
  Information Sciences, 1984
• On the worst case of a minimal spanning tree algorithm for euclidean space
  BIT Numerical Mathematics, 1983
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
  SIAM Journal on Computing, 1982
• Sensitivity analysis of minimum spanning trees and shortest path trees
  Information Processing Letters, 1982
• Finding minimal spanning trees in a euclidean coordinate space
  BIT Numerical Mathematics, 1981
• Two algorithms for constructing a Delaunay triangulation
  International Journal of Parallel Programming, 1980
• A parallel algorithm for constructing minimum spanning trees
  Journal of Algorithms, 1980
• Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
  IEEE Transactions on Computers, 1978
• Closest-point problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1975
• Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs.
  Journal für die reine und angewandte Mathematik (Crelles Journal), 1908