Struct KdTree 

pub struct KdTree { /* private fields */ }

A KD-tree for efficient nearest neighbor queries in 3D.

Implementations

impl KdTree

pub fn build(cloud: &PointCloud) -> Self

Build a KD-tree from a point cloud.

pub fn from_positions(positions: &[[f64; 3]]) -> Self

Build from raw positions.

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

Find the nearest neighbor to a query point.

Returns (index, squared_distance).

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

Find k nearest neighbors.

Returns a vector of (index, squared_distance) sorted by distance.

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

Find all points within a given radius (squared).

pub fn len(&self) -> usize

Number of points in the tree.

pub fn is_empty(&self) -> bool

Whether the tree is empty.

Trait Implementations

impl Debug for KdTree

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

Formats the value using the given formatter.