T-SAH: Animation Optimized Bounding Volume Hierarchies
The result's identifiers
Result code in 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>
Result on the web
<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>
Alternative languages
Result language
angličtina
Original language name
T-SAH: Animation Optimized Bounding Volume Hierarchies
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GAP202%2F12%2F2413" target="_blank" >GAP202/12/2413: Optimal Algorithms for Image Synthesis</a><br>
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
COMPUTER GRAPHICS FORUM
ISSN
0167-7055
e-ISSN
—
Volume of the periodical
34
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
10
Pages from-to
527-536
UT code for WoS article
000358326600050
EID of the result in the Scopus database
2-s2.0-84932139525