Crate nabo_pbc

Expand description

A fast K Nearest Neighbour library for low-dimensional spaces.

This crate is a re-implementation in pure Rust of the C++ library of the same name. This work has been sponsored by Enlightware GmbH.

Example

use nabo_pbc::dummy_point::*;
use nabo_pbc::KDTree;
const K: usize = 2;
let cloud = random_point_cloud(10000);
let tree = KDTree::<_,_,K>::new(&cloud);
let query = random_point();
let neighbour = tree.knn(3, &query);

If you want to have more control on the search, you can use the advanced API:

use nabo_pbc::dummy_point::*;
use nabo_pbc::KDTree;
use nabo_pbc::CandidateContainer;
use nabo_pbc::Parameters;
const K: usize = 2;
let cloud = random_point_cloud(10000);
let tree = KDTree::<_,_,K>::new(&cloud);
let query = random_point();
let mut touch_count = 0;
let neighbour = tree.knn_advanced(
    3,
    &query,
    CandidateContainer::BinaryHeap,
    &Parameters {
        epsilon: 0.0,
        max_radius: 10.0,
        allow_self_match: true,
        sort_results: false,
    },
    Some(&mut touch_count) // statistics
);