I need to compute the minimum euclidean spanning tree in $R^d$ and do it with some algorithm that can do it with complexity near to $\Omega(nlogn)$ where $n$ is the size of the point set.
Right now I'm thinking about usage of delaunay triangulation for my set of points and after that use some MST algorithms like Prim\Kruskal, but as far as I see this won't give me needed complexity bounds.
Could someone point me to the right references about this problem from which I could:
- Learn theory behind
- Write exact algorithm to solve this problem