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.

Documentation

Manual: RANN.L1.pdf
Vignette: None available.

Maintainer: Kirill Müller <krlmlr+r at mailbox.org>

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

Install package and any missing dependencies by running this line in your R console:

install.packages("RANN.L1")

Depends
Imports
Suggests testthat
Enhances
Linking to
Reverse
depends
Reverse
imports
Reverse
suggests
Reverse
enhances
Reverse
linking to

Package RANN.L1
Materials
URL https://github.com/jefferis/RANN/tree/master-L1
Task Views
Version 2.5
Published 2015-05-04
License GPL (>= 3)
BugReports
SystemRequirements
NeedsCompilation yes
Citation
CRAN checks RANN.L1 check results
Package source RANN.L1_2.5.tar.gz