_            _    _        _         _
      /\ \         /\ \ /\ \     /\_\      / /\
      \_\ \       /  \ \\ \ \   / / /     / /  \
      /\__ \     / /\ \ \\ \ \_/ / /     / / /\ \__
     / /_ \ \   / / /\ \ \\ \___/ /     / / /\ \___\
    / / /\ \ \ / / /  \ \_\\ \ \_/      \ \ \ \/___/
   / / /  \/_// / /   / / / \ \ \        \ \ \
  / / /      / / /   / / /   \ \ \   _    \ \ \
 / / /      / / /___/ / /     \ \ \ /_/\__/ / /
/_/ /      / / /____\/ /       \ \_\\ \/___/ /
\_\/       \/_________/         \/_/ \_____\/
r-rann-l1 2.5.2
Channel: guix
Location: gnu/packages/cran.scm (gnu packages cran)
Home page: https://github.com/jefferis/RANN/tree/master-L1
Licenses: GPL 3+
Synopsis: Fast nearest neighbour search using L1 metric
Description:

This package provides tools to find the k nearest neighbours for every point in a given dataset in O(N log N) time using Arya and Mount's ANN library. 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.

Total results: 1