krlmlr/RANN1: Fast Nearest Neighbour Search (wraps Arya and Mount's ANN library)

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.

Getting started

Package details

AuthorSunil Arya and David Mount (for ANN), Samuel E. Kemp, Gregory Jefferis
MaintainerGregory Jefferis <[email protected]>
LicenseGPL (>=3)
Package repositoryView on GitHub
Installation Install the latest version of this package by entering the following in R:
krlmlr/RANN1 documentation built on May 19, 2017, 6:11 a.m.