Struct KdTree 

pub struct KdTree<T: Clone> {
    pub item_count: usize,
    /* private fields */
}

A 3D k-d tree for efficient nearest-neighbor queries.

Best for static point clouds queried repeatedly. Build with KdTree::build(points).

Fields

item_count: usize

Implementations

impl<T: Clone> KdTree<T>

pub fn build(points: Vec<(Vec3, T)>) -> Self

Build a k-d tree from a list of (position, item) pairs.

pub fn k_nearest(&self, query: Vec3, k: usize) -> Vec<(T, Vec3, f32)>

Find the k nearest neighbors to query. Returns (item, position, distance) tuples sorted by distance.

pub fn radius_search(&self, query: Vec3, radius: f32) -> Vec<(T, Vec3, f32)>

Find all points within radius of query.

pub fn is_empty(&self) -> bool

pub fn len(&self) -> usize

Trait Implementations

impl<T: Clone + Clone> Clone for KdTree<T>

fn clone(&self) -> KdTree<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug + Clone> Debug for KdTree<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.