Struct KdTree3D 

pub struct KdTree3D { /* private fields */ }

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

Implementations

impl KdTree3D

pub fn build(points: &[[f64; 3]]) -> Self

Builds a k-d tree from a slice of points.

pub fn nearest_neighbor(&self, query: [f64; 3]) -> (usize, f64)

Returns (index, squared_distance) for the closest point to query.

pub fn k_nearest(&self, query: [f64; 3], k: usize) -> Vec<(usize, f64)>

Returns up to k nearest neighbors, sorted by ascending squared distance.

pub fn range_search(&self, center: [f64; 3], radius: f64) -> Vec<usize>

Returns indices of all points within radius of center.