Showing 2 of total 2 results (show query)
jefferislab
RANN:Fast Nearest Neighbour Search (Wraps ANN Library) Using L2 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 L2 (Euclidean) metric. Please see package 'RANN.L1' for the same functionality using the L1 (Manhattan, taxicab) metric.
Maintained by Gregory Jefferis. Last updated 7 months ago.
ann-librarynearest-neighborsnearest-neighbourscpp
36.4 match 58 stars 12.21 score 1.3k scripts 190 dependents
paulnorthrop
donut:Nearest Neighbour Search with Variables on a Torus
Finds the 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. Two such algorithms, provided by the packages 'RANN' <https://cran.r-project.org/package=RANN>, and 'nabor' <https://cran.r-project.org/package=nabor>, are suggested.
Maintained by Paul J. Northrop. Last updated 2 years ago.
degreesdonutedgesknn-algorithmknn-searchnabornearestnearest-neighbornearest-neighbor-searchnearest-neighborsnearest-neighbour-algorithmnearest-neighboursneighborsperiodicityranntoruswrap
78.1 match 1 stars 4.18 score 5 scripts 1 dependents