hgeometry- Geometric Algorithms, Data structures, and Data types.

Safe HaskellNone




euclideanMST :: (Ord r, Fractional r) => NonEmpty (Point 2 r :+ p) -> Tree (Point 2 r :+ p) Source #

Computes the Euclidean Minimum Spanning Tree. We compute the Delaunay Triangulation (DT), and then extract the EMST. Hence, the same restrictions apply as for the DT:

pre: the input is a *SET*, i.e. contains no duplicate points. (If the input does contain duplicate points, the implementation throws them away)

running time: \(O(n \log n)\)

treeEdges :: Tree a -> [(a, a)] Source #