How do overlapping BVH's help? If we build mutually exclusive Bounding Boxes wouldn't we get the benefits of a BSP - like a Kdtree - where we need to check only for the first intersection?
zyx
@sbhilare I think this mainly helps with making partitions easier. If we require that the primitives in each leaf node be disjoint, and that the bounding boxes of each leaf node be non-overlapping, it may not always be possible to find such a partitioning that's non-trivial.
How do overlapping BVH's help? If we build mutually exclusive Bounding Boxes wouldn't we get the benefits of a BSP - like a Kdtree - where we need to check only for the first intersection?
@sbhilare I think this mainly helps with making partitions easier. If we require that the primitives in each leaf node be disjoint, and that the bounding boxes of each leaf node be non-overlapping, it may not always be possible to find such a partitioning that's non-trivial.