| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Algorithms.Geometry.ConvexHull.JarvisMarch
Synopsis
- convexHull :: (Ord r, Num r) => NonEmpty (Point 2 r :+ p) -> ConvexPolygon p r
- upperHull :: (Num r, Ord r) => NonEmpty (Point 2 r :+ p) -> NonEmpty (Point 2 r :+ p)
- upperHull' :: (Num r, Ord r) => NonEmpty (Point 2 r :+ p) -> NonEmpty (Point 2 r :+ p)
- lowerHull :: (Num r, Ord r) => NonEmpty (Point 2 r :+ p) -> NonEmpty (Point 2 r :+ p)
- lowerHull' :: (Num r, Ord r) => NonEmpty (Point 2 r :+ p) -> NonEmpty (Point 2 r :+ p)
- steepestCcwFrom :: (Ord r, Num r) => (Point 2 r :+ a) -> NonEmpty (Point 2 r :+ b) -> Point 2 r :+ b
- steepestCwFrom :: (Ord r, Num r) => (Point 2 r :+ a) -> NonEmpty (Point 2 r :+ b) -> Point 2 r :+ b
Documentation
convexHull :: (Ord r, Num r) => NonEmpty (Point 2 r :+ p) -> ConvexPolygon p r Source #
Compute the convexhull using JarvisMarch. The resulting polygon is given in clockwise order.
running time: \(O(nh)\), where \(n\) is the number of input points and \(h\) is the complexity of the hull.
upperHull' :: (Num r, Ord r) => NonEmpty (Point 2 r :+ p) -> NonEmpty (Point 2 r :+ p) Source #
Upepr hull from left to right, without any vertical segments.
lowerHull :: (Num r, Ord r) => NonEmpty (Point 2 r :+ p) -> NonEmpty (Point 2 r :+ p) Source #
Computes the lower hull, from left to right. Includes vertical segments at the start.
running time: \(O(nh)\), where \(h\) is the complexity of the hull.
lowerHull' :: (Num r, Ord r) => NonEmpty (Point 2 r :+ p) -> NonEmpty (Point 2 r :+ p) Source #
Jarvis March to compute the lower hull, without any vertical segments.
running time: \(O(nh)\), where \(h\) is the complexity of the hull.