RANN.L1 (2.5)

0 users

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

https://github.com/jefferis/RANN/tree/master-L1
http://cran.r-project.org/web/packages/RANN.L1

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

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

License: GPL (>= 3)

Uses: testthat

Released over 2 years ago.


Ratings

Overall:

  (0 votes)

Documentation:

  (0 votes)

Log in to vote.

Reviews

No one has written a review of RANN.L1 yet. Want to be the first? Write one now.


Related packages:(20 best matches, based on common tags.)


Search for RANN.L1 on google, google scholar, r-help, r-devel.

Visit RANN.L1 on R Graphical Manual.