Copyright	(C) David Himmelstrup
License	see the LICENSE file
Maintainer	Frank Staals, David Himmelstrup
Safe Haskell	None
Language	Haskell2010

Algorithms.Geometry.Diameter

Description

Synopsis

diameter :: (Ord r, Floating r) => [Point 2 r :+ p] -> r
diametralPair :: (Ord r, Num r) => [Point 2 r :+ p] -> Maybe (Point 2 r :+ p, Point 2 r :+ p)

Documentation

Computes the Euclidean diameter by first finding the convex hull.

running time: \(O(n \log n)\)

Computes the Euclidean diameter by first finding the convex hull.

running time: \(O(n \log n)\)