Struct GpuAabbTree 

pub struct GpuAabbTree {
    pub nodes: Vec<BvhNodeGpu>,
    pub root: usize,
    pub num_primitives: usize,
    pub morton_codes: Vec<u32>,
}

Flat AABB tree (BVH) built with parallel bottom-up Morton-code construction.

The tree stores nodes in a flat VecBvhNodeGpu` for cache-friendly GPU traversal. Construction uses a parallel (CPU-mock) bottom-up merge pass after sorting leaf centres by Morton code.

Fields

nodes: Vec<BvhNodeGpu>

Flat array of BVH nodes.

root: usize

Index of the root node.

num_primitives: usize

Number of leaf primitives.

morton_codes: Vec<u32>

Morton codes computed during last build.

Implementations

impl GpuAabbTree

pub fn new() -> Self

Create a new empty GpuAabbTree.

pub fn build(&mut self, aabbs: &[AabbGpu])

Build the tree from a slice of AabbGpu primitives.

Sorts primitives by Morton code, inserts leaf nodes, then performs a CPU-mock parallel bottom-up merge to form internal nodes.

pub fn query(&self, query: &AabbGpu) -> Vec<u32>

Query all leaf primitives whose AABB overlaps query.

pub fn depth(&self) -> usize

Tree depth (longest path from root to leaf).

pub fn leaf_count(&self) -> usize

Count the number of leaf nodes.

pub fn sah_cost(&self) -> f32

Surface Area Heuristic cost of the tree.

SAH cost = sum over all internal nodes of surface_area(node).

Trait Implementations

impl Debug for GpuAabbTree

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

Formats the value using the given formatter.

impl Default for GpuAabbTree

fn default() -> GpuAabbTree

Returns the “default value” for a type.