petal-neighbors
Nearest neighbor search algorithms including a ball tree and a vantage point tree.
Examples
The following example shows how to find two nearest neighbors in a ball tree.
use ndarray::{array, aview1};
use petal_neighbors::BallTree;
let points = array![[1., 1.], [1., 2.], [9., 9.]];
let tree = BallTree::euclidean(points).unwrap();
let (indices, distances) = tree.query(&aview1(&[3., 3.]), 2);
assert_eq!(indices, &[1, 0]); // points[1] is the nearest, points[0] the next.
Minimum Supported Rust Version
This crate is guaranteed to compile on Rust 1.49 and later.
License
Copyright 2019-2021 Petabi, Inc.
Licensed under Apache License, Version 2.0 (the "License"); you may not use this crate except in compliance with the License.
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See LICENSE for the specific language governing permissions and limitations under the License.
Contribution
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be licensed as above, without any additional terms or conditions.
93 Dec 30, 2022
283 Dec 21, 2022
2.3k Jan 3, 2023
8 Sep 23, 2022
28 Aug 20, 2022
13 Mar 10, 2022
2 Aug 7, 2022
15 Dec 15, 2022
3 Nov 20, 2023
25 Apr 29, 2022
95 Jan 1, 2023
50 Feb 11, 2023
7 Jul 1, 2023
71 Dec 28, 2022
3.5k Dec 30, 2022
2 Apr 1, 2022
154 Jan 4, 2023
7 Dec 23, 2022