Struct crystal_ball::shapes::BVH

pub struct BVH<S: Shape> {
    pub shapes: Vec<S>,
    pub nodes: Vec<LinearBVHNode>,
}

A bounding volume hierarchy of Shapes.

In short, this allows for much faster render times by storing the individual shapes in spatial nodes (bounding volumes). Ray intersection is then performed to determine which nodes are hit. This quickly rules out large numbers of shapes, so there don’t need to be any ray intersections against them.

The implementation is based on the PBR book.

Fields

shapes: Vec<S>

The BVH’s shapes.

nodes: Vec<LinearBVHNode>

The BVH’s nodes.

Implementations

impl<S: Shape> BVH<S>

pub fn init(max_shapes_per_node: u8, shapes: Vec<S>) -> Self

Create a new BVH.

pub fn intersects(&self, ray: Ray) -> Option<(Hit, &S)>

Performs a ray intersection against self, returning the closest hit if there is one as well as the corresponding shape.

Trait Implementations

impl<S: Clone + Shape> Clone for BVH<S>

fn clone(&self) -> BVH<S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: Debug + Shape> Debug for BVH<S>

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

Formats the value using the given formatter.