@hackage KdTree0.1

KdTree, for efficient search in K-dimensional point clouds.

This is a simple library for k-d trees in Haskell. It enables efficient searching through collections of points in O(log N) time on average, using the nearestNeighbor function.