Struct KdTree 

pub struct KdTree { /* private fields */ }

Static KD-tree. Points are stored rearranged in tree order, together with their original indices.

Implementations

impl KdTree

pub fn new(points: impl IntoIterator<Item = [f64; 3]>) -> Self

Creates from f64 points.

pub fn from_f32(points: &[[f32; 3]]) -> Self

Creates from f32 points (PLY).

pub fn len(&self) -> usize

Number of points.

pub fn is_empty(&self) -> bool

True if there are no points.

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

Nearest point (original index, distance²). None for an empty tree.

pub fn any_within(&self, q: &[f64; 3], r: f64) -> bool

Whether any point lies within radius r (distance ≤ r) (early exit).

pub fn within_radius(&self, q: &[f64; 3], r: f64) -> Vec<usize>

All points within radius r (original index, order unspecified).

pub fn nearest_many(&self, queries: &[[f64; 3]]) -> Vec<Option<(usize, f64)>>

Parallel nearest-neighbor query.

pub fn any_within_many_f32(&self, queries: &[[f32; 3]], r: f64) -> Vec<bool>

Parallel radius test (f32 queries). result[i] = whether query i has a point within r.

Trait Implementations

impl Clone for KdTree

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for KdTree

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

Formats the value using the given formatter.

impl Default for KdTree

fn default() -> Self

Returns the “default value” for a type.