Answers are grounded in this paper and cite their sources.
Skewed oriented bounding boxes (SOBBs) have recently been proposed as an alternative to the axis‐aligned bounding boxes (AABBs) for the construction of bounding volume hierarchies (BVHs) for ray tracing. We expand this idea further and propose efficient algorithms for constructing compressed wide BVHs with SOBBs and updating these BVHs for dynamic scenes. The proposed approach typically yields between 1.07x and 1.6x faster traversal of secondary rays than the state‐of‐the‐art compressed wide AABB BVH with extreme cases approaching 10x speedup. This is achieved at the cost of 1.15x slower build times and 7‐15 bits of extra information per node. Our newly proposed refit algorithm for SOBB hierarchies is more than 3x faster than the original SOBB refit approach and requires roughly 4x less scratch memory. This makes it only about 1.45x slower compared to the refit of an equivalent wide AABB hierarchy while maintaining the faster performance profile of tighter bounding volumes. Together, these advances position SOBB hierarchies as a viable alternative for real‐time ray tracing.
No takes yet. Share an insight, caveat, or question.
Káčerik et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: