k nearest neighbours in a dataset of specified points,
adding the option to wrap certain variables on a torus. The user chooses
the algorithm to use to find the nearest neighbours.
nnt performs the nearest neighbour
search. There is also a rudimentary plot method:
The default algorithm is that provided by the function
nn2 in the
Other possibilities are the
nn2 function in the
RANN.L1-package and the
function in the
vignette("donut-vignette", package = "donut") for an
overview of the package.
Arya, S., Mount, D., Kemp, S. E. and Jefferis, G. (2019) RANN: Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 Metric. R package version 2.6.1. https://CRAN.R-project.org/package=RANN
Arya, S., Mount, D., Kemp, S. E., Jefferis, G. and Muller, K. (2018) RANN: Fast Nearest Neighbour Search (Wraps ANN Library) Using L1 Metric. R package version 2.5.2. https://CRAN.R-project.org/package=RANN.L1
Elseberg J., Magnenat S., Siegwart R., Nuchter, A. (2012) Comparison of nearest-neighbor-search strategies and implementations for efficient shape registration. Journal of Software Engineering for Robotics (JOSER), 3(1), 2-12 https://CRAN.R-project.org/package=nabor
nnt for nearest neighbour with some variables
wrapped on a torus.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.