kdt: Fast and flexible k-d trees for various types of point queries.
This package includes static and dynamic versions of k-d trees, as well as "Map" variants that store data at each point in the k-d tree structure. Supports nearest neighbor, k nearest neighbors, points within a given radius, and points within a given range. To learn to use this package, start with the documentation for the Data.KdTree.Static module.
|Versions [RSS]||0.1.0, 0.2.0, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.2.5|
|Dependencies||base (>=4.6 && <5), deepseq (>=1.3), deepseq-generics (>=0.2.0.0), heap (>=1.0.0) [details]|
|Copyright||Luis G. Torres, 2014|
|Author||Luis G. Torres|
|Source repo||head: git clone https://github.com/giogadi/kdt.git -b master|
|Uploaded||by giogadi at 2022-07-18T16:50:31Z|
|Distributions||LTSHaskell:0.2.5, NixOS:0.2.5, Stackage:0.2.5|
|Reverse Dependencies||1 direct, 0 indirect [details]|
|Downloads||5489 total (14 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]