RANN: Fast Nearest Neighbour Search (Wraps ANN Library) Using L2
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 L2
(Euclidean) metric. Please see package 'RANN.L1' for the same
functionality using the L1 (Manhattan, taxicab) metric.
||BRISC, celestial, RapidPolygonLookup, RWBP, saasCNV
||anticlust, Compositional, condiments, CytoTree, Directional, DUBStepR, EntropyMCMC, evtclass, FOCI, gjam, HGC, hopkins, iCellR, infercnv, insect, isokernel, KPC, langevitour, ldbod, LOMAR, lookout, magicaxis, maotai, mastif, monocle, nhdplusTools, ProbitSpatial, Rdimtools, Rfast2, rgeoprofile, rliger, RsimMosaic, scINSIGHT, SCORPIUS, scPOP, Seurat, spOccupancy, SSLR, SUNGEO, symphony, themis, unbalanced, uSORT, xcms
||AMAPVox, butcher, caret, dimRed, donut, dyndimred, flacco, fscaret, nabor, recipes, sensitivity, spatialEco, StatMatch
Please use the canonical form
to link to this page.