RANN - A fork of the knnFinder package that exposes more of the functionality of Arya and Mount's ANN Library
Package R docs
|Title:||Fast Nearest Neighbour Search|
|Author:||Samuel E. Kemp, Gregory Jefferis|
|Maintainer:||Gregory Jefferis |
|Description:||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.1). Two functions allow searches for nearest neighbours within a point set or between two separate point sets. There is support for approximate as well as exact searches, fixed radius searches and bd as well as kd trees. This version updates ANN 1.1.3 and fixes package compilation on Windows.|
Project RANN doesn't have any custom web pages. Use the menu on the left to navigate the default RForge pages for this project.