SOBB: Skewed Oriented Bounding Boxes for Ray Tracing

Abstract We propose skewed oriented bounding boxes (SOBB) as a novel bounding primitive for accelerating the calculation of ray‐scene intersections. SOBBs have the same memory footprint as the well‐known oriented bounding boxes (OBB) and can be used with a similar ray intersection algorithm. We propose an efficient algorithm for constructing a BVH with SOBBs, using a transformation from a standard BVH built for axis‐aligned bounding boxes (AABB). We use discrete orientation polytopes as a temporary bounding representation to find tightly fitting SOBBs. Additionally, we propose a compression scheme for SOBBs that makes their memory requirements comparable to those of AABBs. For secondary rays, the SOBB BVH provides a ray tracing speedup of 1.0‐11.0x over the AABB BVH and it is 1.1x faster than the OBB BVH on average. The transformation of AABB BVH to SOBB BVH is, on average, 2.6x faster than the ditetrahedron‐based AABB BVH to OBB BVH transformation.

Authors

Institutions

Publication Details

Journal
Computer Graphics Forum
Published
2025-04-18
DOI
https://doi.org/10.1111/cgf.70062
Citations
3
Primary Topic
Computer Graphics and Visualization Techniques
Type
article
Field-Weighted Citation Impact
10.62

Funders

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

SOBB: Skewed Oriented Bounding Boxes for Ray Tracing

Jiřı́ Bittner, Martin Káčerik
3 citations
Computer Graphics Forum
Computer Graphics and Visualization Techniques
10.62
article

SOBB: Skewed Oriented Bounding Boxes for Ray Tracing

Jiřı́ Bittner, Martin Káčerik
article en
3 citations

Abstract

Abstract We propose skewed oriented bounding boxes (SOBB) as a novel bounding primitive for accelerating the calculation of ray‐scene intersections. SOBBs have the same memory footprint as the well‐known oriented bounding boxes (OBB) and can be used with a similar ray intersection algorithm. We propose an efficient algorithm for constructing a BVH with SOBBs, using a transformation from a standard BVH built for axis‐aligned bounding boxes (AABB). We use discrete orientation polytopes as a temporary bounding representation to find tightly fitting SOBBs. Additionally, we propose a compression scheme for SOBBs that makes their memory requirements comparable to those of AABBs. For secondary rays, the SOBB BVH provides a ray tracing speedup of 1.0‐11.0x over the AABB BVH and it is 1.1x faster than the OBB BVH on average. The transformation of AABB BVH to SOBB BVH is, on average, 2.6x faster than the ditetrahedron‐based AABB BVH to OBB BVH transformation.

Computer Graphics ForumVol. 44(2)
Czech Technical University in Prague (CZ)
Smithsonian Institution, České Vysoké Učení Technické v Praze, Research Center for Informatics, Czech Technical University in Prague
Openalex Percentile: Top 2%
Computer Graphics and Visualization Techniques
10.62
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.