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 intersecting_ray( &self, origin: Vec3, direction: Vec3, tolerance: f64, out: &mut Vec<usize>, )

Collect indices whose box intersects the forward ray. Unlike a segment query this has no far limit (camera clipping planes need not bound CPU picking). direction need not be normalized; boxes behind the origin are excluded and grazing hits are retained.

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

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

Trait Implementations

impl Debug for Bvh

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

Formats the value using the given formatter.