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.

Package details

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)
URL https://github.com/jefferis/RANN/tree/master-L1
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the RANN.L1 package in your browser

Any scripts or data that you put into this service are public.

RANN.L1 documentation built on May 30, 2017, 3:24 a.m.