Struct Bvh 

pub struct Bvh<T: Clone> {
    pub item_count: usize,
    /* private fields */
}

A complete BVH tree.

Fields

item_count: usize

Implementations

impl<T: Clone> Bvh<T>

pub fn build(items: Vec<(Aabb, T)>) -> Self

Build a BVH from a list of (bounds, item) pairs using SAH heuristic.

pub fn query_sphere(&self, center: Vec3, radius: f32) -> Vec<T>

pub fn query_ray(&self, origin: Vec3, dir: Vec3, max_t: f32) -> Vec<(T, f32)>

pub fn query_aabb(&self, bounds: &Aabb) -> Vec<T>

pub fn is_empty(&self) -> bool

pub fn item_count(&self) -> usize