RANN.L1: Fast Nearest Neighbour Search (Wraps ANN Library) Using L1 Metric
Version 2.5

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.

Browse man pages Browse package API and functions Browse package files

AuthorSunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis, Kirill Müller
Date of publication2015-05-04 11:54:30
MaintainerKirill Müller <krlmlr+r@mailbox.org>
LicenseGPL (>= 3)
Version2.5
URL https://github.com/jefferis/RANN/tree/master-L1
Package repositoryView on CRAN
InstallationInstall the latest version of this package by entering the following in R:
install.packages("RANN.L1")

Man pages

nn2: Nearest Neighbour Search
RANN.L1-package: Wrapper for Arya and Mount's Approximate Nearest Neighbours...

Functions

RANN.L1 Man page
RANN.L1-package Man page
nn2 Man page Source code

Files

inst
inst/COPYRIGHT
tests
tests/testthat.R
tests/testthat
tests/testthat/test-nn.R
src
src/kd_util.cpp
src/bd_fix_rad_search.cpp
src/Makevars
src/kd_split.cpp
src/kd_util.h
src/kd_pr_search.cpp
src/pr_queue_k.h
src/ANN
src/ANN/ANNperf.h
src/ANN/ANN.h
src/ANN/ANNx.h
src/bd_tree.cpp
src/bd_tree.h
src/ANN.cpp
src/kd_pr_search.h
src/pr_queue.h
src/kd_split.h
src/kd_tree.h
src/bd_search.cpp
src/bd_pr_search.cpp
src/kd_fix_rad_search.cpp
src/kd_dump.cpp
src/Makevars.win
src/NN.cc
src/brute.cpp
src/kd_fix_rad_search.h
src/kd_search.cpp
src/kd_tree.cpp
src/kd_search.h
NAMESPACE
NEWS
R
R/nn.R
R/RANN-package.R
R/zzz.R
README.md
MD5
DESCRIPTION
man
man/nn2.Rd
man/RANN.L1-package.Rd
RANN.L1 documentation built on May 20, 2017, 1:08 a.m.