kdt: Fast and flexible k-d trees for various types of point queries.
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
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.
Properties
Versions | 0.1.0, 0.2.0, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.2.5, 0.2.5, 0.2.6 |
---|---|
Change log | changelog.md |
Dependencies | base (>=4.6 && <5), deepseq (>=1.3), deepseq-generics (>=0.2.0.0), heap (>=1.0.0) [details] |
License | MIT |
Copyright | Luis G. Torres, 2014 |
Author | Luis G. Torres |
Maintainer | lgtorres42@gmail.com |
Category | Data |
Home page | https://github.com/giogadi/kdt |
Source repo | head: git clone https://github.com/giogadi/kdt.git -b master |
Uploaded | by giogadi at 2022-07-18T16:48:26Z |
Modules
[Index] [Quick Jump]
Downloads
- kdt-0.2.5.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees