Struct Bvh 

pub struct Bvh {
    pub nodes: Vec<BvhNode>,
    pub primitive_indices: Vec<u32>,
    pub escape: Vec<u32>,
}

Flat hierarchy and stable source-primitive permutation.

Fields

nodes: Vec<BvhNode>

Root-first compact nodes.

primitive_indices: Vec<u32>

Source primitive indices addressed by leaves.

escape: Vec<u32>

Per-node stackless-traversal successor, parallel to nodes.

Implementations

impl Bvh

pub fn bounds(&self) -> Aabb

Root bounds, or the empty bound for an empty hierarchy.

pub fn ray_candidates( &self, origin: Vec3, direction: Vec3, traversal: &mut Vec<u32>, output: &mut Vec<u32>, )

Appends source indices whose bounds overlap a ray. Both vectors are cleared and reused; results follow deterministic hierarchy order.

pub fn sphere_candidates( &self, center: Vec3, radius: f32, traversal: &mut Vec<u32>, output: &mut Vec<u32>, )

Appends source indices whose primitive bounds overlap a query sphere. Both caller vectors retain their allocations for reuse.

pub fn aabb_candidates( &self, query: Aabb, traversal: &mut Vec<u32>, output: &mut Vec<u32>, )

Appends source indices whose primitive bounds overlap an axis-aligned query box. Both caller vectors retain their storage.

impl Bvh

pub const ESCAPE_END: u32 = u32::MAX

Escape value that ends a stackless traversal.

pub fn build<S: BvhSource + ?Sized>(source: &S) -> Result<Self, BvhBuildError>

Builds a hierarchy over finite, non-empty bounds. Invalid primitives are omitted instead of poisoning the structure-wide bounds.

Errors

Returns BvhBuildError when a source row, node or primitive offset cannot fit the compact GPU representation.

pub fn rebuild<S: BvhSource + ?Sized>( &mut self, source: &S, scratch: &mut BvhBuildScratch, ) -> Result<(), BvhBuildError>

Rebuilds in existing storage, retaining node, permutation and sort capacities for moving coordinates.

Errors

Returns BvhBuildError when a source row, node or primitive offset cannot fit the compact GPU representation.

pub fn refit<S: BvhSource + ?Sized>( &mut self, source: &S, ) -> Result<(), BvhBuildError>

Refits leaf and branch bounds without changing topology or primitive order. The work is O(resident primitives + nodes) and reuses every allocation retained by the hierarchy.

Errors

Returns BvhBuildError when a primitive used by the existing topology is absent or no longer has finite, ordered bounds.

Trait Implementations

impl Clone for Bvh

fn clone(&self) -> Self

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.

impl Default for Bvh

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for Bvh

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for Bvh