The KdTree package
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.
Properties
| Versions | 0.1, 0.2, 0.2.1 |
|---|---|
| Dependencies | base (<5), QuickCheck |
| License | BSD3 |
| Copyright | Copyright 2011, Issac Trotts |
| Author | Issac Trotts |
| Maintainer | issac.trotts@gmail.com |
| Category | Graphics |
| Home page | https://github.com/ijt/kdtree |
| Source repository | git clone git@github.com:ijt/kdtree.git |
| Executables | KdTreeTest |
| Upload date | Mon Jan 16 22:46:48 UTC 2012 |
| Uploaded by | IssacTrotts |
| Built on | ghc-7.2 |
Modules
- Data
- Trees
Downloads
- KdTree-0.2.1.tar.gz (Cabal source package)
- package description (included in the package)