| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Algorithms.Geometry.ConvexHull.DivideAndConqueror
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 conqueror. The resulting polygon is given in clockwise order.