Join
Euclidean minimum spanning trees in three and more dimensions
Compute the Euclidean minimum spanning tree of n points in three or more dimensions in near-linear time; the best known is about n^4/3 in 3D.
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.