Nothing
RANN.L1: Fast Nearest Neighbour Search (Wraps ANN Library) Using L1 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 L1 (Manhattan, taxicab) metric. Please see package 'RANN' for the same functionality using the L2 (Euclidean) metric.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Sunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis, Kirill Müller |
| Maintainer | ORPHANED |
| License | GPL (>= 3) |
| Version | 2.5.2 |
| URL | https://github.com/jefferis/RANN/tree/master-L1 |
| Package repository | View 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.
