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

GeomAlg.Delaunay.Delaunay

Description

An optimal divide and conquer algorithm for the delaunay triangulation. aus cite{guibas85}, siehe cite{leach92:improving} und cite{shewchuk:triangle} fr mgliche Verbesserungen.

Synopsis

delaunay :: (Ord a, Num a) => [P2 a] -> (QEDS (DelEdge (P2 a)), EdgeRef, EdgeRef) delaunayST :: (Ord a, Num a) => [P2 a] -> ST s (QEDS s (P2 a), EdgeRef, EdgeRef) data DelEdge a = DelEdge { source :: a target :: a } type QEDS s a = QEDS s (DelEdge a) org :: QEDS s a -> EdgeRef -> ST s a dest :: QEDS s a -> EdgeRef -> ST s a connect :: QEDS s a -> EdgeRef -> EdgeRef -> ST s EdgeRef isLeftOf :: (Ord a, Num a) => QEDS s (P2 a) -> P2 a -> EdgeRef -> ST s Bool isRightOf :: (Ord a, Num a) => QEDS s (P2 a) -> P2 a -> EdgeRef -> ST s Bool

Documentation

delaunay :: (Ord a, Num a) => [P2 a] -> (QEDS (DelEdge (P2 a)), EdgeRef, EdgeRef) Source

Der Algorithmus

delaunayST :: (Ord a, Num a) => [P2 a] -> ST s (QEDS s (P2 a), EdgeRef, EdgeRef) Source

data DelEdge a Source

Anpassen der QEDS Constructors DelEdge source :: a target :: a Instances Show a => Show (DelEdge a)

type QEDS s a = QEDS s (DelEdge a) Source

org :: QEDS s a -> EdgeRef -> ST s a Source

dest :: QEDS s a -> EdgeRef -> ST s a Source

connect :: QEDS s a -> EdgeRef -> EdgeRef -> ST s EdgeRef Source

isLeftOf :: (Ord a, Num a) => QEDS s (P2 a) -> P2 a -> EdgeRef -> ST s Bool Source

isRightOf :: (Ord a, Num a) => QEDS s (P2 a) -> P2 a -> EdgeRef -> ST s Bool Source

Hilfsfunktionen

Produced by Haddock version 2.4.2