Algorithms.Geometry.Diameter.Naive

Description

Synopsis

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

Documentation

Computes the Euclidean diameter by naively trying all pairs.

running time: \(O(n^2)\)

Computes the Euclidean diametral pair by naively trying all pairs.

running time: \(O(n^2)\)

diametralPairWith :: Ord r => (Point d r -> Point d r -> r) -> [Point d r :+ p] -> Maybe (Point d r :+ p, Point d r :+ p) Source #

Given a distance function and a list of points pts, computes the diametral pair by naively trying all pairs.

running time: \(O(n^2)\)