T-SAH: Animation Optimized Bounding Volume Hierarchies

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00230140" target="_blank" >RIV/68407700:21230/15:00230140 - isvavai.cz</a>

Výsledek na webu

<a href="https://diglib.eg.org/handle/10.1111/cgf12581" target="_blank" >https://diglib.eg.org/handle/10.1111/cgf12581</a>

DOI - Digital Object Identifier

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

Jazyk výsledku

angličtina

Název v původním jazyce

T-SAH: Animation Optimized Bounding Volume Hierarchies

Popis výsledku v původním jazyce

We propose a method for creating a bounding volume hierarchy (BVH) that is optimized for all frames of a given animated scene. The method is based on a novel extension of surface area heuristic to temporal domain (T-SAH). We perform iterative BVH optimization using T-SAH and create a single BVH accounting for scene geometry distribution at different frames of the animation. Having a single optimized BVH for the whole animation makes our method extremely easy to integrate to any application using BVHs, limiting the per-frame overhead only to refitting the bounding volumes.We evaluated the T-SAH optimized BVHs in the scope of real-time GPU ray tracing. We demonstrate, that our method can handle even highly complex inputs with large deformations and significant topology changes. The results show, that in a vast majority of tested scenes our method provides significantly better run-time performance than traditional SAH and also better performance than GPU based per-frame BVH rebuild.

Název v anglickém jazyce

T-SAH: Animation Optimized Bounding Volume Hierarchies

Popis výsledku anglicky

We propose a method for creating a bounding volume hierarchy (BVH) that is optimized for all frames of a given animated scene. The method is based on a novel extension of surface area heuristic to temporal domain (T-SAH). We perform iterative BVH optimization using T-SAH and create a single BVH accounting for scene geometry distribution at different frames of the animation. Having a single optimized BVH for the whole animation makes our method extremely easy to integrate to any application using BVHs, limiting the per-frame overhead only to refitting the bounding volumes.We evaluated the T-SAH optimized BVHs in the scope of real-time GPU ray tracing. We demonstrate, that our method can handle even highly complex inputs with large deformations and significant topology changes. The results show, that in a vast majority of tested scenes our method provides significantly better run-time performance than traditional SAH and also better performance than GPU based per-frame BVH rebuild.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F12%2F2413" target="_blank" >GAP202/12/2413: Optimální algoritmy pro syntézu obrazu</a><br>

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2015

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

—

Svazek periodika

34

Číslo periodika v rámci svazku

2

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

10

Strana od-do

527-536

Kód UT WoS článku

000358326600050

EID výsledku v databázi Scopus

2-s2.0-84932139525