Copyright | (C) Frank Staals |
---|---|

License | see the LICENSE file |

Maintainer | Frank Staals |

Safe Haskell | None |

Language | Haskell2010 |

\(O(n\log n)\) time divide and conquer algorithm to compute the convex hull of a set of \(n\) points in \(\mathbb{R}^2\).

## Synopsis

- convexHull :: (Ord r, Num r) => NonEmpty (Point 2 r :+ p) -> ConvexPolygon p r

# Documentation

convexHull :: (Ord r, Num r) => NonEmpty (Point 2 r :+ p) -> ConvexPolygon p r Source #

\(O(n \log n)\) time ConvexHull using divide and conquer. The resulting polygon is given in clockwise order.