Struct rtbvh::binned_sah::BinnedSahBuilder

pub struct BinnedSahBuilder<'a, T: Primitive<i32>> { /* fields omitted */ }

Implementations

impl<'a, T: Primitive<i32>> BinnedSahBuilder<'a, T>

pub fn new(aabbs: &'a [Aabb<i32>], primitives: &'a [T]) -> Self

pub fn with_max_depth(self, depth: usize) -> Self

Maximum depth of tree

pub fn with_bin_count(self, bin_count: usize) -> Self

Maximum number of bins to check for splitting a node

pub fn with_max_leaf_size(self, max_leaf_size: usize) -> Self

Maximum number of primitives inside a node

pub fn with_traversal_cost(self, traversal_cost: f32) -> Self

Cost to determine for splitting a node with the SAH algorithm for traversing a node

Trait Implementations

impl<'a, T: Primitive<i32>> BuildAlgorithm for BinnedSahBuilder<'a, T>

fn build(self) -> Bvh