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.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.