kdt: Fast and flexible k-d trees for various types of point queries.

[ data, library, mit ] [ Propose Tags ] [ Report a vulnerability ]

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.

Modules

[Index]

Data
- KdMap
  - Data.KdMap.Dynamic
  - Data.KdMap.Static
- KdTree
  - Data.KdTree.Dynamic
  - Data.KdTree.Static
- Data.Point2d

Downloads

kdt-0.1.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

giogadi

For package maintainers and hackage trustees

edit package information

Candidates

0.2.5

Versions [RSS]	0.1.0, 0.2.0, 0.2.1, 0.2.2, 0.2.3, 0.2.4, 0.2.5, 0.2.6
Dependencies	base (>=4.6 && <4.8), deepseq (>=1.3 && <1.4), deepseq-generics (>=0.1.1.1), pqueue (>=1.2.1 && <1.3), QuickCheck (>=2.7 && <2.8) [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 2014-11-11T04:19:29Z
Distributions	LTSHaskell:0.2.6, Stackage:0.2.6
Reverse Dependencies	1 direct, 0 indirect [details]
Downloads	5980 total (2 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]