Struct Bvh 

pub struct Bvh {
    pub nodes: Vec<BvhNode>,
    pub prim_indices: Vec<u32>,
    pub prim_count: usize,
}

Surface Area Heuristic (SAH) BVH over triangles.

Fields

nodes: Vec<BvhNode>

All BVH nodes.

prim_indices: Vec<u32>

Primitive indices (reordered during build).

prim_count: usize

Number of primitives.

Implementations

impl Bvh

pub fn build(triangles: &[Triangle]) -> Self

Build a BVH from a list of triangles using SAH.

pub fn intersect<'a>( &self, ray: &Ray, triangles: &'a [Triangle], ) -> Option<(HitRecord, &'a Triangle)>

Traverse the BVH and find the nearest intersection.

pub fn intersect_any(&self, ray: &Ray, triangles: &[Triangle]) -> bool

Test if any intersection exists (shadow ray query).

Trait Implementations

impl Clone for Bvh

fn clone(&self) -> Bvh

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Bvh

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

Formats the value using the given formatter.