KdTree: KdTree, for efficient search in K-dimensional point clouds.
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.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 & Contributors |
Author | Issac Trotts |
Maintainer | jesse.kempf@binarysunrise.io |
Category | Data Mining, Data Structures, Graphics, Machine Learning |
Home page | https://github.com/binarysunrise-io/kdtree |
Source repo | head: git clone git@github.com:binarysunrise-io/kdtree.git |
Uploaded | by jessekempf at 2017-09-29T05:51:50Z |
Distributions | NixOS:0.2.2.1 |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 6008 total (8 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2017-09-29 [all 1 reports] |