Struct Bvh 

pub struct Bvh {
    pub root: Option<BvhNode>,
    pub primitives: Vec<BvhPrimitive>,
}

A BVH tree built from a flat list of BvhPrimitives.

Fields

root: Option<BvhNode>

Tree root (if there is at least one primitive).

primitives: Vec<BvhPrimitive>

All primitives passed to Bvh::build.

Implementations

impl Bvh

pub fn build(primitives: Vec<BvhPrimitive>) -> Self

Build a BVH from a list of primitives using a median-split strategy guided by the longest axis (SAH-inspired).

pub fn query_aabb(&self, query: &Aabb) -> Vec<usize>

Return the object_ids of all primitives whose AABB overlaps query.

pub fn query_ray( &self, origin: [f32; 3], direction: [f32; 3], max_t: f32, ) -> Vec<usize>

Return the object_ids of all primitives hit by the given ray within distance max_t.

pub fn node_count(&self) -> usize

Total number of nodes in the tree.

pub fn depth(&self) -> usize

Maximum depth of the tree (root = depth 1).