Struct Bvh 

pub struct Bvh { /* private fields */ }

Static BVH over per-item boxes; queries return indices into the slice the tree was built from.

Implementations

impl Bvh

pub fn build(boxes: &[Aabb]) -> Self

pub fn overlapping(&self, query: Aabb, tolerance: f64, out: &mut Vec<usize>)

Collect indices whose box overlaps query expanded by tolerance.

pub fn intersecting_segment( &self, start: Vec3, end: Vec3, tolerance: f64, out: &mut Vec<usize>, )

Collect indices whose box (expanded by tolerance) intersects the segment from start to end.

pub fn containing_point( &self, point: Vec3, tolerance: f64, out: &mut Vec<usize>, )

Collect indices whose box (expanded by tolerance) contains point.