SOBB: Skewed Oriented Bounding Boxes for Ray Tracing

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F25%3A00383427" target="_blank" >RIV/68407700:21230/25:00383427 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1111/cgf.70062" target="_blank" >https://doi.org/10.1111/cgf.70062</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1111/cgf.70062" target="_blank" >10.1111/cgf.70062</a>

Jazyk výsledku

angličtina

Název v původním jazyce

SOBB: Skewed Oriented Bounding Boxes for Ray Tracing

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

SOBB: Skewed Oriented Bounding Boxes for Ray Tracing

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Výzkumné centrum informatiky</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

COMPUTER GRAPHICS FORUM

ISSN

0167-7055

e-ISSN

1467-8659

Svazek periodika

44

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

11

Strana od-do

1-11

Kód UT WoS článku

001470111500001

EID výsledku v databázi Scopus

2-s2.0-105002814228