| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Algorithms.Geometry.ConvexHull.QuickHull
Synopsis
- convexHull :: (Ord r, Fractional r, Show r, Show p) => NonEmpty (Point 2 r :+ p) -> ConvexPolygon p r
Documentation
convexHull :: (Ord r, Fractional r, Show r, Show p) => NonEmpty (Point 2 r :+ p) -> ConvexPolygon p r Source #
ConvexHull using Quickhull. The resulting polygon is given in clockwise order.
running time: \(O(n^2)\)