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.

Modules

[Index] [Quick Jump]

Downloads

• kdt-0.2.6.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