SATO: Surface Area Traversal Order for Shadow Ray Tracing

We present the surface area traversal order (SATO) metric to accelerate shadow ray traversal. Our formulation uses the surface area of each child node to compute the TO. In this metric, we give a traversal priority to the child node with the larger surface area to quickly find occluders. Our algorithm reduces the pre‐processing overhead significantly, and is much faster than other metrics. Overall, the SATO is useful for ray tracing large and complex dynamic scenes (e.g. a few million triangles) with shadows.

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

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

[3]  Charles D. Hansen,et al.  RTSAH Traversal Order for Occlusion Rays , 2011, Comput. Graph. Forum.

[4]  Sung-Bong Yang,et al.  gkDtree: A group-based parallel update kd-tree for interactive ray tracing , 2013, J. Syst. Archit..

[5]  Alexander Reshetov,et al.  Fast Ray Tracing for Modern General Purpose CPU , 2002 .

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

[7]  S.G. Parker,et al.  Design for Parallel Interactive Ray Tracing Systems , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[8]  Kellogg S. Booth,et al.  Heuristics for ray tracing using space subdivision , 1990, The Visual Computer.

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

[10]  Brian E. Smits.  Efficiency issues for ray tracing , 1998, J. Graphics, GPU, & Game Tools.

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

[12]  Tack-Don Han,et al.  T&I engine: traversal and intersection engine for hardware accelerated ray tracing , 2011, SA '11.

[13]  Kun Zhou,et al.  Real-time KD-tree construction on graphics hardware , 2008, SIGGRAPH Asia '08.

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

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

[16]  Bobby Bodenheimer,et al.  Synthesis and evaluation of linear motion transitions , 2008, TOGS.

[17]  Vlastimil Havran,et al.  Visibility driven BVH build up algorithm for ray tracing , 2012, Comput. Graph..

[18]  Sean Keely,et al.  Accelerating shadow rays using volumetric occluders and modified kd-tree traversal , 2009, High Performance Graphics.

[19]  László Szirmay-Kalos,et al.  Accelerating animation through verification of shooting walks , 2003, SCCG '03.

[20]  Maxim Shevtsov,et al.  Highly Parallel Fast KD‐tree Construction for Interactive Ray Tracing of Dynamic Scenes , 2007, Comput. Graph. Forum.

[21]  I. Wald,et al.  On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N) , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

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

[23]  Gordon Stoll,et al.  Razor: An architecture for dynamic multiresolution ray tracing , 2011, TOGS.

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

[25]  Dinesh Manocha,et al.  Selective ray tracing for interactive high-quality shadows , 2009 .

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

[27]  Kun Zhou,et al.  Real-time KD-tree construction on graphics hardware , 2008, SIGGRAPH 2008.

[28]  Dinesh Manocha,et al.  Virtual Tawaf: A case study in simulating the behavior of dense, heterogeneous crowds , 2011, 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops).

[29]  Brian E. Smits.  Efficiency Issues for Ray Tracing , 1998, J. Graphics, GPU, & Game Tools.

[30]  Xinguo Liu,et al.  SAH KD-tree construction on GPU , 2011, HPG '11.

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

[32]  Tack-Don Han,et al.  Ordered depth-first layouts for ray tracing , 2010, SA '10.

[33]  John C. Hart,et al.  Parallel SAH k-D tree construction , 2010, HPG '10.

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

[35]  Vlastimil Havran,et al.  Heuristic ray shooting algorithms , 2000 .