RANN (2.2.1)
Fast Nearest Neighbour Search.
http://cran.r-project.org/web/packages/RANN
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). 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.
Maintainer:
Gregory Jefferis
Author(s): Samuel E. Kemp, Gregory Jefferis
License: GPL-2
Uses: Does not use any package
Reverse depends: Morpho
Reverse suggests: caret, GeoXp, LICORS, spdep
Released 7 months ago.
3 previous versions
- RANN_2.1.3. Released over 1 year ago.
- RANN_2.1.2. Released about 3 years ago.
- RANN_2.1. Released over 3 years ago.
Ratings
Overall: |
|
Documentation: |
|
Log in to vote.
Reviews
No one has written a review of RANN yet. Want to be the first? Write one now.
Related packages: … (20 best matches, based on common tags.)
Search for RANN on google, google scholar, r-help, r-devel.
Visit RANN on R Graphical Manual.
