Struct rtbvh::spatial_sah::SpatialSahBuilder

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

Implementations

impl<'a, T: Primitive<i32> + SpatialTriangle> SpatialSahBuilder<'a, T>

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

pub fn with_binning_pass_count(self, pass_count: usize) -> Self

Number of spatial binning passes that are run in order to find a spatial split. This increases accuracy without increasing the number of bins.

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

pub fn with_split_factor(self, split_factor: f32) -> Self

pub fn with_alpha(self, alpha: f32) -> Self

Trait Implementations

impl<'a, T: Primitive<i32> + SpatialTriangle> BuildAlgorithm for SpatialSahBuilder<'a, T>

fn build(self) -> Bvh