Reduced max bvh tree depth.
Reduced from 64 to 42. This still allows each BVH to hold 4.4 trillion elements, but it guarantees that the accel ray's traversal bitstack can accommodate at least two nested max-depth trees.
This commit is contained in:
parent
0cbf851451
commit
a940630a27
|
@ -8,7 +8,7 @@ use math::log2_64;
|
||||||
use super::objects_split::{sah_split, median_split};
|
use super::objects_split::{sah_split, median_split};
|
||||||
|
|
||||||
|
|
||||||
pub const BVH_MAX_DEPTH: usize = 64;
|
pub const BVH_MAX_DEPTH: usize = 42;
|
||||||
|
|
||||||
/// An intermediary structure for creating a BVH.
|
/// An intermediary structure for creating a BVH.
|
||||||
#[derive(Debug)]
|
#[derive(Debug)]
|
||||||
|
|
Loading…
Reference in New Issue
Block a user