RANN (2.6.1)

0 users

Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric.


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. The distance is computed using the L2 (Euclidean) metric. Please see package 'RANN.L1' for the same functionality using the L1 (Manhattan, taxicab) metric.

Maintainer: Gregory Jefferis
Author(s): Sunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis

License: GPL (>= 3)

Uses: testthat
Reverse depends: BRISC, celestial, Morpho, RapidPolygonLookup, saasCNV, spNNGP, StatMatch
Reverse suggests: adespatial, agricolae, butcher, caret, dimRed, donut, flacco, fscaret, GeoXp, LICORS, MRIaggr, nabor, recipes, spdep

Released about 1 year ago.

9 previous versions



  (0 votes)


  (0 votes)

Log in to vote.


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.