Kdtree Python Packages

napf

nanoflann wrapper for python and maybe fortran

aann

All nearest-neighbor search using neighborhood graphs

flannrust

Bit-exact Rust port of nanoflann with Python bindings faster than SciPy's cKDTree

trcc

Density-peak clustering with path-density mutual-reachability merging. Sub-quadratic O(n log n) via a C++ pybind11/nanoflann kd-tree. 30× speedup at n=50k.

pygeocity

This package will reverse geocode i.e., take a latitude and longitude coordinate which will return the country, city name, alternate name(s), population, timezone, and exact coordinates of the city.

kdtrees

Python implementation of a K-D Tree as pseudo-balanced Tree

dbcv-revisit

Optimized implementation of Density Based Cluster Validation (DBCV)

ranged-kdtree

A simple and fast KD-tree for points in Python for kNN or nearest points. (damm short at just ~60 lines) No libraries needed.