{-
%------------------------------------------------------------------------------
% Copyright (C) 1997, 1998, 2008, 2009 Joern Dinkla, www.dinkla.net
%------------------------------------------------------------------------------
%
% see
%     Joern Dinkla, Geometrische Algorithmen in Haskell, Diploma Thesis,
%     University of Bonn, Germany, 1998. 
%
-}

-- | Calculates the convex hull with the Delaunay triangulation.
-- This is 
module GeomAlg.Applications.DelaunayHull (delaunayHull) where

import GeomAlg.Point2   ( Point2 )
import GeomAlg.Polygon  ( Polygon2, Polygon (..) )
import GeomAlg.Delaunay.Delaunay ( delaunay )
import qualified GeomAlg.Delaunay.QEDSstatic as S

delaunayHull	              :: (Ord a, Num a) => [Point2 a] -> Polygon2 a
delaunayHull ps		      = undefined

{-
delaunayHull ps		      = PolygonCCW (map (\ e -> S.org q e) es)
  where (q,l,r)		      = delaunay ps
	es		    		  = S.ring q S.rprev l
-}