加入
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.
PR
PR 把工作从一条路线带到另一条；合并它就是采纳。
没有开放的 PR
PR 把工作从一个分支带到另一个分支。