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

GeomAlg.Applications.AllNearest

Description

Find all nearest neighbors in a list of two dimensional points See http://en.wikipedia.org/wiki/Nearest_neighbor_search for background. siehe cite[K 5.3]{klein97:cg}, cite[K. 5.5]{orourke94:cg}.

Synopsis

allNearest :: (Ord a, Num a) => [P2 a] -> [(a, (P2 a, P2 a))] minSqrDistances :: (Ord a, Num a) => [(P2 a, [P2 a])] -> [(a, (P2 a, P2 a))] closestPair :: (Ord a, Num a) => [P2 a] -> (a, (P2 a, P2 a)) adjacent :: (Ord a, Num a) => QEDS (DelEdge (P2 a)) -> [(P2 a, [P2 a])] dest :: QEDS (DelEdge a) -> EdgeRef -> a org :: QEDS (DelEdge a) -> EdgeRef -> a

Documentation

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

allNearest ermittelt fr jeden Punkt seinen nchsten Nachbarn

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

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

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

adjacent bestimmt die Adjazensliste einer QEDS.

dest :: QEDS (DelEdge a) -> EdgeRef -> a Source

org :: QEDS (DelEdge a) -> EdgeRef -> a Source

Produced by Haddock version 2.4.2