hgeometry-0.12.0.1: Geometric Algorithms, Data structures, and Data types.
Copyright(C) David Himmelstrup
Licensesee the LICENSE file
MaintainerFrank Staals, David Himmelstrup
Safe HaskellNone
LanguageHaskell2010

Algorithms.Geometry.Diameter.ConvexHull

Description

 
Synopsis

Documentation

diameter :: (Ord r, Floating r) => [Point 2 r :+ p] -> r Source #

Computes the Euclidean diameter by first finding the convex hull.

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

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

Computes the Euclidean diameter by first finding the convex hull.

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