hgeometry-0.12.0.4: Geometric Algorithms, Data structures, and Data types.
$$O(n\log n)$$ time algorithm algorithm to compute the Euclidean minimum spanning tree of a set of $$n$$ points in $$\mathbb{R}^2$$.