Geometry.ConvexHull2

Documentation

type Point2D = (Int, Int)

The algorithm performed in this module is Graham Scan

(>*<) :: Int -> (Int, Int) -> (Int, Int)

lift2To3 :: Point2D -> (Int, Int, Int)

isColinear :: Point2D -> Point2D -> Point2D -> Bool

isColinearFromList :: [Point2D] -> Bool

project3To2 :: (Int, Int, Int) -> Point2D

determinant :: (Int, Int, Int) -> (Int, Int, Int) -> (Int, Int, Int) -> Rational

semiHullUp :: [Point2D] -> Maybe Point2D -> [Point2D]

semiHullDown :: [Point2D] -> Maybe Point2D -> [Point2D]

leftMost :: [Point2D] -> Point2D

rightMost :: [Point2D] -> Point2D

isPointUp :: Point2D -> Point2D -> Point2D -> Bool

isPointDown :: Point2D -> Point2D -> Point2D -> Bool

dropColinearPoints :: [Point2D] -> [Point2D]

convexHull2 :: [Point2D] -> [Point2D]

Orphan instances

Num (Int, Int)

Methods

(+) :: (Int, Int) -> (Int, Int) -> (Int, Int)

(-) :: (Int, Int) -> (Int, Int) -> (Int, Int)

(*) :: (Int, Int) -> (Int, Int) -> (Int, Int)

negate :: (Int, Int) -> (Int, Int)

abs :: (Int, Int) -> (Int, Int)

signum :: (Int, Int) -> (Int, Int)

fromInteger :: Integer -> (Int, Int)