KdTree: KdTree, for efficient search in K-dimensional point clouds.
[ bsd3, data-mining, data-structures, graphics, library, machine-learning ]
[ Propose Tags ]
[ Report a vulnerability ]
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.
[Skip to Readme]
Downloads
- KdTree-0.2.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.1, 0.2, 0.2.1, 0.2.1.1, 0.2.2.0, 0.2.2.1 |
---|---|
Dependencies | base (<5), QuickCheck [details] |
License | BSD-3-Clause |
Copyright | Copyright 2011, Issac Trotts |
Author | Issac Trotts |
Maintainer | issac.trotts@gmail.com |
Category | Graphics |
Home page | https://github.com/ijt/kdtree |
Source repo | head: git clone git@github.com:ijt/kdtree.git |
Uploaded | by IssacTrotts at 2012-01-16T22:46:48Z |
Distributions | NixOS:0.2.2.1 |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Executables | KdTreeTest |
Downloads | 6052 total (14 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |