-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | triangulation of polygons
--   
--   An implementation of a simple triangulation algorithm for polygons
--   without holes, crossings (and maybe other anomalies that I am not
--   aware of). The code is explained in this diploma thesis:
--   <a>www.dinkla.net/download/GeomAlgHaskell.pdf</a>. The original author
--   made a very big library that needs a long time to compile. Thats why
--   only one algorithm was extracted and freed from a big net of inner
--   dependencies and types.
@package triangulation
@version 0.1


-- | Triangulation of simple polygons after Kong, Everett, Toussaint 91
--   with some changes by T.Vogt: return indices instead of coordinates of
--   triangles
--   
--   see Joern Dinkla, Geometrische Algorithmen in Haskell, Diploma Thesis,
--   University of Bonn, Germany, 1998.
module Graphics.Triangulation.KETTriangulation
ketTri :: Points -> [Int] -> [(Int, Int, Int)]

module Graphics.Triangulation.Triangulation
type Points = Array Int (Float, Float)
type TriangulationFunction = Points -> [Int] -> [(Int, Int, Int)]
triangulate :: TriangulationFunction -> Geometry -> Geometry