T‐SAH: Animation Optimized Bounding Volume Hierarchies

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.

[1]  Ingo Wald,et al.  Fast Construction of SAH BVHs on the Intel Many Integrated Core (MIC) Architecture , 2012, IEEE Transactions on Visualization and Computer Graphics.

[2]  B. Walter,et al.  Fast agglomerative clustering for rendering , 2008, 2008 IEEE Symposium on Interactive Ray Tracing.

[3]  Timo Aila,et al.  Understanding the efficiency of ray traversal on GPUs , 2009, High Performance Graphics.

[4]  Daniel Kopta,et al.  Fast, effective BVH updates for animated scenes , 2012, I3D '12.

[5]  A. Kensler.  Tree rotations for improving bounding volume hierarchies , 2008, 2008 IEEE Symposium on Interactive Ray Tracing.

[6]  Ingo Wald,et al.  Embree: a kernel framework for efficient CPU ray tracing , 2014, ACM Trans. Graph..

[7]  Guy E. Blelloch,et al.  Efficient BVH construction via approximate agglomerative clustering , 2013, HPG '13.

[8]  James T. Kajiya,et al.  Ray tracing complex scenes , 1986, SIGGRAPH.

[9]  Timo Aila,et al.  Fast parallel construction of high-quality bounding volume hierarchies , 2013, HPG '13.

[10]  Hans-Peter Seidel,et al.  Ray Tracing Animated Scenes using Motion Decomposition , 2006, Comput. Graph. Forum.

[11]  I. Wald,et al.  On fast Construction of SAH-based Bounding Volume Hierarchies , 2007, 2007 IEEE Symposium on Interactive Ray Tracing.

[12]  Kirill Garanzha,et al.  Simpler and faster HLBVH with work queues , 2011, HPG '11.

[13]  H.-P. Seidel,et al.  On the Fast Construction of Spatial Hierarchies for Ray Tracing , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[14]  John Salmon,et al.  Automatic Creation of Object Hierarchies for Ray Tracing , 1987, IEEE Computer Graphics and Applications.

[15]  W.A. Hunt.  Corrections to the surface area metric with respect to mail-boxing , 2008, 2008 IEEE Symposium on Interactive Ray Tracing.

[16]  Tero Karras,et al.  Maximizing parallelism in the construction of BVHs, octrees, and k-d trees , 2012, EGGH-HPG'12.

[17]  Timo Aila,et al.  On quality metrics of bounding volume hierarchies , 2013, HPG '13.

[18]  Dinesh Manocha,et al.  Ray tracing dynamic scenes using selective restructuring , 2007, SIGGRAPH '07.

[19]  D. Manocha,et al.  RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[20]  Ingo Wald,et al.  Ray tracing deformable scenes using dynamic bounding volume hierarchies , 2007, TOGS.

[21]  Philipp Slusallek,et al.  Distributed interactive ray tracing of dynamic scenes , 2003, IEEE Symposium on Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003..

[22]  Jacopo Pantaleoni,et al.  HLBVH: hierarchical LBVH construction for real-time ray tracing of dynamic geometry , 2010, HPG '10.

[23]  Benjamin Mora.  Naive ray-tracing: A divide-and-conquer approach , 2011, TOGS.

[24]  Vlastimil Havran,et al.  RDH: ray distribution heuristics for construction of spatial data structures , 2009, SCCG.

[25]  Ingo Wald,et al.  State of the Art in Ray Tracing Animated Scenes , 2009, Comput. Graph. Forum.

[26]  John Dingliana,et al.  A Cost Metric for Scene-Interior Ray Origins , 2009, Eurographics.

[27]  Vlastimil Havran,et al.  Fast Insertion‐Based Optimization of Bounding Volume Hierarchies , 2013, Comput. Graph. Forum.

[28]  Dinesh Manocha,et al.  Fast BVH Construction on GPUs , 2009, Comput. Graph. Forum.

[29]  Ingo Wald,et al.  Asynchronous BVH construction for ray tracing dynamic scenes on parallel multi-core architectures , 2007, EGPGV '07.

[30]  Minjae Lee,et al.  SRDH: specializing BVH construction and traversal order using representative shadow ray sets , 2012, EGGH-HPG'12.

[31]  Kirill Garanzha.  The Use of Precomputed Triangle Clusters for Accelerated Ray Tracing in Dynamic Scenes , 2009, Comput. Graph. Forum.