Work towards convex partition of polygons

src/Geometry/Polygon.hs

@@ -151,6 +151,14 @@ convexHull :: [Point2] -> [Point2]
 convexHull (x : y : z : xs) = grahamScan $ orderAroundFirst $ sortOn (\(V2 a b) -> (b, a)) (x : y : z : xs)
 convexHull _ = error "Tried to create the convex hull of two or fewer points"
 
+-- assumes the points go "anticlockwise" around a non-self intersecting shape
+convexPartition :: [Point2] -> [[Point2]]
+convexPartition (x:y:z:[]) = [[x,y,z]]
+convexPartition (x:y:z:xs)
+    | isLHS x y z = [x,y,z] : convexPartition (x:z:xs)
+    | otherwise = convexPartition (y:z:xs <> [x])
+convexPartition _ = error "unexpected shape for convexPartition"
+
 {- | Creates the convex hull of a set of points.
  assumes no repetition of points: try nubbing!
 -}