Fast, effective BVH updates for animated scenes
| Autor: | Andrew Kensler, Thiago Ize, Al Davis, Erik Brunvand, Daniel Kopta, Josef Spjut |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Bounding volume
Bounding overwatch Computer science Computer graphics (images) ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION Ray tracing (graphics) Animation Bounding volume hierarchy Bounding interval hierarchy Frame rate ComputingMethodologies_COMPUTERGRAPHICS Rendering (computer graphics) |
| Zdroj: | I3D |
| DOI: | 10.1145/2159616.2159649 |
| Popis: | Bounding volume hierarchies (BVHs) are a popular acceleration structure choice for animated scenes rendered with ray tracing. This is due to the relative simplicity of refitting bounding volumes around moving geometry. However, the quality of such a refitted tree can degrade rapidly if objects in the scene deform or rearrange significantly as the animation progresses, resulting in dramatic increases in rendering times and a commensurate reduction in the frame rate. The BVH could be rebuilt on every frame, but this could take significant time. We present a method to efficiently extend refitting for animated scenes with tree rotations, a technique previously proposed for off-line improvement of BVH quality for static scenes. Tree rotations are local restructuring operations which can mitigate the effects that moving primitives have on BVH quality by rearranging nodes in the tree during each refit rather than triggering a full rebuild. The result is a fast, lightweight, incremental update algorithm that requires negligible memory, has minor update times, parallelizes easily, avoids significant degradation in tree quality or the need for rebuilding, and maintains fast rendering times. We show that our method approaches or exceeds the frame rates of other techniques and is consistently among the best options regardless of the animated scene. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|