Eintrag weiter verarbeiten
T‐SAH: Animation Optimized Bounding Volume Hierarchies
Gespeichert in:
| Zeitschriftentitel: | Computer Graphics Forum |
|---|---|
| Personen und Körperschaften: | , |
| In: | Computer Graphics Forum, 34, 2015, 2, S. 527-536 |
| Format: | E-Article |
| Sprache: | Englisch |
| veröffentlicht: |
Wiley
|
| Schlagwörter: |
| author_facet |
Bittner, J. Meister, D. Bittner, J. Meister, D. |
|---|---|
| author |
Bittner, J. Meister, D. |
| spellingShingle |
Bittner, J. Meister, D. Computer Graphics Forum T‐SAH: Animation Optimized Bounding Volume Hierarchies Computer Graphics and Computer-Aided Design |
| author_sort |
bittner, j. |
| spelling |
Bittner, J. Meister, D. 0167-7055 1467-8659 Wiley Computer Graphics and Computer-Aided Design http://dx.doi.org/10.1111/cgf.12581 <jats:title>Abstract</jats:title><jats:p>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.</jats:p> T‐SAH: Animation Optimized Bounding Volume Hierarchies Computer Graphics Forum |
| doi_str_mv |
10.1111/cgf.12581 |
| facet_avail |
Online |
| finc_class_facet |
Informatik |
| format |
ElectronicArticle |
| fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMS9jZ2YuMTI1ODE |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMS9jZ2YuMTI1ODE |
| institution |
DE-Gla1 DE-Zi4 DE-15 DE-Rs1 DE-Pl11 DE-105 DE-14 DE-Ch1 DE-L229 DE-D275 DE-Bn3 DE-Brt1 DE-D161 |
| imprint |
Wiley, 2015 |
| imprint_str_mv |
Wiley, 2015 |
| issn |
0167-7055 1467-8659 |
| issn_str_mv |
0167-7055 1467-8659 |
| language |
English |
| mega_collection |
Wiley (CrossRef) |
| match_str |
bittner2015tsahanimationoptimizedboundingvolumehierarchies |
| publishDateSort |
2015 |
| publisher |
Wiley |
| recordtype |
ai |
| record_format |
ai |
| series |
Computer Graphics Forum |
| source_id |
49 |
| title |
T‐SAH: Animation Optimized Bounding Volume Hierarchies |
| title_unstemmed |
T‐SAH: Animation Optimized Bounding Volume Hierarchies |
| title_full |
T‐SAH: Animation Optimized Bounding Volume Hierarchies |
| title_fullStr |
T‐SAH: Animation Optimized Bounding Volume Hierarchies |
| title_full_unstemmed |
T‐SAH: Animation Optimized Bounding Volume Hierarchies |
| title_short |
T‐SAH: Animation Optimized Bounding Volume Hierarchies |
| title_sort |
t‐sah: animation optimized bounding volume hierarchies |
| topic |
Computer Graphics and Computer-Aided Design |
| url |
http://dx.doi.org/10.1111/cgf.12581 |
| publishDate |
2015 |
| physical |
527-536 |
| description |
<jats:title>Abstract</jats:title><jats:p>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.</jats:p> |
| container_issue |
2 |
| container_start_page |
527 |
| container_title |
Computer Graphics Forum |
| container_volume |
34 |
| format_de105 |
Article, E-Article |
| format_de14 |
Article, E-Article |
| format_de15 |
Article, E-Article |
| format_de520 |
Article, E-Article |
| format_de540 |
Article, E-Article |
| format_dech1 |
Article, E-Article |
| format_ded117 |
Article, E-Article |
| format_degla1 |
E-Article |
| format_del152 |
Buch |
| format_del189 |
Article, E-Article |
| format_dezi4 |
Article |
| format_dezwi2 |
Article, E-Article |
| format_finc |
Article, E-Article |
| format_nrw |
Article, E-Article |
| _version_ |
1792335956508934153 |
| geogr_code |
not assigned |
| last_indexed |
2024-03-01T14:52:46.898Z |
| geogr_code_person |
not assigned |
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=T%E2%80%90SAH%3A+Animation+Optimized+Bounding+Volume+Hierarchies&rft.date=2015-05-01&genre=article&issn=1467-8659&volume=34&issue=2&spage=527&epage=536&pages=527-536&jtitle=Computer+Graphics+Forum&atitle=T%E2%80%90SAH%3A+Animation+Optimized+Bounding+Volume+Hierarchies&aulast=Meister&aufirst=D.&rft_id=info%3Adoi%2F10.1111%2Fcgf.12581&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1792335956508934153 |
| author | Bittner, J., Meister, D. |
| author_facet | Bittner, J., Meister, D., Bittner, J., Meister, D. |
| author_sort | bittner, j. |
| container_issue | 2 |
| container_start_page | 527 |
| container_title | Computer Graphics Forum |
| container_volume | 34 |
| description | <jats:title>Abstract</jats:title><jats:p>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.</jats:p> |
| doi_str_mv | 10.1111/cgf.12581 |
| facet_avail | Online |
| finc_class_facet | Informatik |
| format | ElectronicArticle |
| format_de105 | Article, E-Article |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_de520 | Article, E-Article |
| format_de540 | Article, E-Article |
| format_dech1 | Article, E-Article |
| format_ded117 | Article, E-Article |
| format_degla1 | E-Article |
| format_del152 | Buch |
| format_del189 | Article, E-Article |
| format_dezi4 | Article |
| format_dezwi2 | Article, E-Article |
| format_finc | Article, E-Article |
| format_nrw | Article, E-Article |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMTExMS9jZ2YuMTI1ODE |
| imprint | Wiley, 2015 |
| imprint_str_mv | Wiley, 2015 |
| institution | DE-Gla1, DE-Zi4, DE-15, DE-Rs1, DE-Pl11, DE-105, DE-14, DE-Ch1, DE-L229, DE-D275, DE-Bn3, DE-Brt1, DE-D161 |
| issn | 0167-7055, 1467-8659 |
| issn_str_mv | 0167-7055, 1467-8659 |
| language | English |
| last_indexed | 2024-03-01T14:52:46.898Z |
| match_str | bittner2015tsahanimationoptimizedboundingvolumehierarchies |
| mega_collection | Wiley (CrossRef) |
| physical | 527-536 |
| publishDate | 2015 |
| publishDateSort | 2015 |
| publisher | Wiley |
| record_format | ai |
| recordtype | ai |
| series | Computer Graphics Forum |
| source_id | 49 |
| spelling | Bittner, J. Meister, D. 0167-7055 1467-8659 Wiley Computer Graphics and Computer-Aided Design http://dx.doi.org/10.1111/cgf.12581 <jats:title>Abstract</jats:title><jats:p>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.</jats:p> T‐SAH: Animation Optimized Bounding Volume Hierarchies Computer Graphics Forum |
| spellingShingle | Bittner, J., Meister, D., Computer Graphics Forum, T‐SAH: Animation Optimized Bounding Volume Hierarchies, Computer Graphics and Computer-Aided Design |
| title | T‐SAH: Animation Optimized Bounding Volume Hierarchies |
| title_full | T‐SAH: Animation Optimized Bounding Volume Hierarchies |
| title_fullStr | T‐SAH: Animation Optimized Bounding Volume Hierarchies |
| title_full_unstemmed | T‐SAH: Animation Optimized Bounding Volume Hierarchies |
| title_short | T‐SAH: Animation Optimized Bounding Volume Hierarchies |
| title_sort | t‐sah: animation optimized bounding volume hierarchies |
| title_unstemmed | T‐SAH: Animation Optimized Bounding Volume Hierarchies |
| topic | Computer Graphics and Computer-Aided Design |
| url | http://dx.doi.org/10.1111/cgf.12581 |