A Collection of Code Snippets in as Many Programming Languages as Possible
This project is maintained by TheRenegadeCoder
Welcome to the Convex Hull in Haskell page! Here, you'll find the source code for this program as well as a description of how the program works.
module Main where
import Data.List (minimumBy, maximumBy)
import Data.Ord (comparing)
import Control.Monad (guard, forM_)
import Text.Read (readMaybe)
import System.Environment (getArgs)
type Point = (Int, Int)
stringToListMaybe :: String -> Maybe [Int]
stringToListMaybe str = readMaybe $ "[" ++ str ++ "]" :: Maybe [Int]
cross :: Point -> Point -> Point -> Int
cross (x1, y1) (x2, y2) (x3, y3) = (x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1)
dist :: Point -> Point -> Int
dist (x1, y1) (x2, y2) = (x2 - x1) ^ 2 + (y2 - y1) ^ 2
jarvis :: [Point] -> [Point]
jarvis points = startingPoint : go startingPoint
where
startingPoint = minimumBy (comparing fst) points
nextPoint prev = maximumBy (comparePoints prev) points
comparePoints prev p1 p2 =
case compare (cross prev p1 p2) 0 of
EQ -> compare (dist prev p1) (dist prev p2)
x -> x
go cur
| next == startingPoint = []
| otherwise = next : go next
where next = nextPoint cur
parseArgs :: [String] -> Maybe [Point]
parseArgs [xs, ys] = do
xs' <- stringToListMaybe xs
ys' <- stringToListMaybe ys
guard (length xs' > 2 && length xs' == length ys')
return (zip xs' ys')
parseArgs _ = Nothing
printPoint :: Point -> IO ()
printPoint (x, y) = putStrLn $ "(" ++ show x ++ ", " ++ show y ++ ")"
main :: IO ()
main = do
args <- getArgs
case parseArgs args of
Nothing -> putStrLn "Usage: please provide at least 3 x and y coordinates as separate lists (e.g. \"100, 440, 210\")"
Just coords -> forM_ (jarvis coords) printPoint
Convex Hull in Haskell was written by:
If you see anything you'd like to change or update, please consider contributing.
No 'How to Implement the Solution' section available. Please consider contributing.
No 'How to Run the Solution' section available. Please consider contributing.