Trait IsKNearestSearchable

pub trait IsKNearestSearchable<Search, Find> {
    // Required methods
    fn nearest(&self, search: &Search) -> Result<Find>;
    fn knearest(&self, search: &Search, n: usize, result: &mut Vec<Find>);
}

IsKNearestSearchable trait used for search structures which can be queried for nearest neighbours. You should only implement this, if your solution is rather efficient

Required Methods

fn nearest(&self, search: &Search) -> Result<Find>

Should return the nearest neighbour to search, if there is any

fn knearest(&self, search: &Search, n: usize, result: &mut Vec<Find>)

Should return the k nearest neighbours to search

Implementors

impl<PSearch, PFind> IsKNearestSearchable<PSearch, PFind> for KdTree<PFind>

where PSearch: Is3D, PFind: Is3D + Clone,