GeomAlg-0.2.3: Library of geometric algorithms in Haskell Source code Contents Index

GeomAlg.Triangulation.MonotonePartition

Description

Partition into monotone polygons. see [R94, ch. 2.2] [BKOS97, ch. 3.2]

Synopsis

monotonePartition :: (Ord a, Fractional a) => Polygon2 a -> [Polygon2 a] diagonals :: (Ord a, Fractional a) => Polygon2 a -> [Line2 a] data Vertex a = Start (P2 a) | End (P2 a) | Split (P2 a) | Merge (P2 a) | Regular (P2 a) classify :: (Num a, Ord a) => (P2 a, P2 a, P2 a) -> Vertex a

Documentation

monotonePartition :: (Ord a, Fractional a) => Polygon2 a -> [Polygon2 a] Source

Partition the polygon with diagonals in O(n log n).

diagonals :: (Ord a, Fractional a) => Polygon2 a -> [Line2 a] Source

data Vertex a Source

The type of vertices (see [BKOS97, p. 52). Constructors Start (P2 a) End (P2 a) Split (P2 a) Merge (P2 a) Regular (P2 a) Instances Num a => Show (Vertex a)

classify :: (Num a, Ord a) => (P2 a, P2 a, P2 a) -> Vertex a Source

Produced by Haddock version 2.4.2