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

GeomAlg.Applications.ClosestPair

Description

Find the closest pair of points in a list of points. See http://en.wikipedia.org/wiki/Closest_pair_problem for background. siehe cite[K. 2.3.1, K.2.4]{klein97:cg}

Synopsis

naiveMinSqrDistance :: (Point p, Ord a, Num a) => [p a] -> a naiveClosestPair :: (Point p, Ord a, Num a) => [p a] -> (p a, p a) naiveClosest :: (Point p, Ord a, Num a) => [p a] -> (a, (p a, p a)) minSqrDistance :: (Point p, Ord a, Num a) => [p a] -> a closestPair :: (Point p, Ord a, Num a) => [p a] -> (p a, p a) closest :: (Point p, Ord a, Num a) => [p a] -> (a, (p a, p a))

Documentation

naiveMinSqrDistance :: (Point p, Ord a, Num a) => [p a] -> a Source

naiveClosestPair :: (Point p, Ord a, Num a) => [p a] -> (p a, p a) Source

naiveClosest :: (Point p, Ord a, Num a) => [p a] -> (a, (p a, p a)) Source

minSqrDistance :: (Point p, Ord a, Num a) => [p a] -> a Source

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

closest :: (Point p, Ord a, Num a) => [p a] -> (a, (p a, p a)) Source

Im wesentlichen der Algorithmus aus cite[K. 2.3]{klein97:cg}

Produced by Haddock version 2.4.2