Finds the k nearest neighbours for every point in a given dataset in O(N log N) time using Arya and Mount's ANN library (v1.1.3). There is support for approximate as well as exact searches, fixed radius searches and bd as well as kd trees.
|Author||Sunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis|
|Date of publication||2015-04-20 17:50:07|
|Maintainer||Gregory Jefferis <firstname.lastname@example.org>|
|License||GPL (>= 3)|