KdTree
@
0.2
This is a simple library for k-d trees in Haskell. It enables searching through collections of points in O(log N) average time, using the nearestNeighbor function.
Published
Indexed
Loading...
Readme
Loading...
Links
| Registry | hackage.haskell.org |
| Download | Download |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Version Details
| PURL |
pkg:hackage/KdTree@0.2
spec |