Struct BvhNode 

#[repr(C, align(16))]
pub struct BvhNode {
    pub min_left: [f32; 4],
    pub max_radius: [f32; 4],
}

One compact BVH node. Internal children are adjacent; leaves address the hierarchy’s primitive-index array.

Fields

min_left: [f32; 4]

Minimum corner followed by left-child or first-primitive index.

max_radius: [f32; 4]

Maximum corner followed by the largest primitive half-extent.

Implementations

impl BvhNode

pub fn bounds(self) -> Aabb

Node bounds.

pub fn maximum_radius(self) -> f32

Largest primitive half-extent below this node.

pub fn is_leaf(self) -> bool

True for a leaf node.

pub fn children(self) -> Option<(u32, u32)>

Adjacent child indices for an internal node.

pub fn primitive_range(self) -> Option<Range<u32>>

Range into Bvh::primitive_indices for a leaf.

Trait Implementations

impl Clone for BvhNode

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for BvhNode

impl Debug for BvhNode

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

Formats the value using the given formatter.

impl Default for BvhNode

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for BvhNode

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

Equality operator ==.

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

Inequality operator !=.

impl Pod for BvhNode

impl StructuralPartialEq for BvhNode

impl Zeroable for BvhNode

fn zeroed() -> Self

Calls zeroed.