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

GeomAlg.ConvexHull.MergeHull

Description

The mergehull algorithm.

Synopsis

mergeHull :: (Ord a, Num a) => [P2 a] -> Polygon2 a incrementalMergeHull :: (Fractional a, Ord a) => [P2 a] -> Polygon2 a bottomupMergeHull :: (Num a, Ord a) => [P2 a] -> Polygon2 a insert :: (Fractional a, Ord a) => [P2 a] -> P2 a -> [P2 a] merge :: (Ord a, Num a) => [P2 a] -> [P2 a] -> [P2 a] lowerBridge :: (Ord a, Num a) => [P2 a] -> [P2 a] -> (P2 a, P2 a) upperBridge :: (Ord a, Num a) => [P2 a] -> [P2 a] -> (P2 a, P2 a)

Documentation

mergeHull :: (Ord a, Num a) => [P2 a] -> Polygon2 a Source

Merge hull

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

bottomupMergeHull :: (Num a, Ord a) => [P2 a] -> Polygon2 a Source

Auch eine bottomup-Version lt sich schreiben.

insert :: (Fractional a, Ord a) => [P2 a] -> P2 a -> [P2 a] Source

Mit der Funktion |merge| lt sich ein inkrementeller Algorithmus mit Laufzeit $O(n^2)$ entwerfen.

merge :: (Ord a, Num a) => [P2 a] -> [P2 a] -> [P2 a] Source

lowerBridge :: (Ord a, Num a) => [P2 a] -> [P2 a] -> (P2 a, P2 a) Source

upperBridge :: (Ord a, Num a) => [P2 a] -> [P2 a] -> (P2 a, P2 a) Source

Produced by Haddock version 2.4.2