Wide SOBB Hierarchies for Ray Tracing of Dynamic Scenes

Abstract 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.

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2026-11-13
DOI
https://doi.org/10.1111/cgf.70643
Primary Topic
Computer Graphics and Visualization Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Wide SOBB Hierarchies for Ray Tracing of Dynamic Scenes

Jiřı́ Bittner, Martin Káčerik, T. Hlavová
3 links
Computer Graphics Forum
Computer Graphics and Visualization Techniques
article

Wide SOBB Hierarchies for Ray Tracing of Dynamic Scenes

Jiřı́ Bittner, Martin Káčerik, T. Hlavová
article en

Abstract

Abstract 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.

Computer Graphics Forum
Czech Technical University in Prague (CZ)
Smithsonian Institution, České Vysoké Učení Technické v Praze, Grantová Agentura České Republiky
Computer Graphics and Visualization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon