Algorithms.Geometry.ClosestPair

\(O(n\log n)\) time algorithm to compute the closest pair among a set of \(n\) points in \(\mathbb{R}^2\).

Documentation

closestPair :: (Ord r, Num r) => LSeq 2 (Point 2 r :+ p) -> Two (Point 2 r :+ p)

Classical divide and conquer algorithm to compute the closest pair among \(n\) points.

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