A Vectorized Traversal Algorithm for Ray Tracing

This article presents an optimized ray tracing algorithm which improves standard existing algorithms by processing simultaneously a large set of rays and carrying out a single traversal of the spatial indexing of the scene with all rays. This allows hardware SIMD functionality to be used efficiently and produces coherent memory accesses. Furthermore, during the single traversal, rays are grouped in such a way that these advantages are maintained for non coherent ray sets. The algorithm was observed to reduce the computation costs with respect to other standard solutions, especially for non coherent ray sets. It is worth noting that its characteristics make it especially suitable for graphics hardware.

[1]  Markus Wagner,et al.  Interactive Rendering with Coherent Ray Tracing , 2001, Comput. Graph. Forum.

[2]  C.P. Gribble,et al.  Coherent ray tracing via stream filtering , 2008, 2008 IEEE Symposium on Interactive Ray Tracing.

[3]  Kellogg S. Booth,et al.  Report from the chair , 1986 .

[4]  Arthur Appel,et al.  Some techniques for shading machine renderings of solids , 1968, AFIPS Spring Joint Computing Conference.

[5]  Henrik Wann Jensen,et al.  Global Illumination using Photon Maps , 1996, Rendering Techniques.

[6]  Ingo Wald,et al.  Realtime ray tracing and interactive global illumination , 2004, Ausgezeichnete Informatikdissertationen.

[7]  Andrew Kensler,et al.  SIMD Ray Stream Tracing - SIMD Ray Traversal with Generalized Ray Packets and On-the-fly Re-Ordering - , 2007 .

[8]  Mateu Sbert,et al.  An Integral Geometry Based Method for Fast Form‐Factor Computation , 1993, Comput. Graph. Forum.

[9]  Carlos Ureña,et al.  An Efficient Parametric Algorithm for Octree Traversal , 2000, WSCG.

[10]  John C. Hart,et al.  The ray engine , 2002, HWWS '02.

[11]  Tomas Akenine-Möller,et al.  Fast, Minimum Storage Ray-Triangle Intersection , 1997, J. Graphics, GPU, & Game Tools.

[12]  L. Santaló.  Integral geometry and geometric probability , 1976 .

[13]  S. Boulos,et al.  Adaptive ray packet reordering , 2008, 2008 IEEE Symposium on Interactive Ray Tracing.

[14]  Brian Wyvill,et al.  Memory‐Conserving Bounding Volume Hierarchies with Coherent Raytracing , 2006, Comput. Graph. Forum.

[15]  Tomas Akenine-Möller,et al.  Fast, Minimum Storage Ray-Triangle Intersection , 1997, J. Graphics, GPU, & Game Tools.

[16]  I. Wald,et al.  Ray Tracing on the Cell Processor , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[17]  P Hanrahan,et al.  Using caching and breadth-first search to speed up ray-tracing , 1986 .

[18]  Pat Hanrahan,et al.  Rendering complex scenes with memory-coherent ray tracing , 1997, SIGGRAPH.

[19]  Tim Foley,et al.  KD-tree acceleration structures for a GPU raytracer , 2005, HWWS '05.

[20]  Pat Hanrahan,et al.  Ray tracing on a connection machine , 1988, ICS '88.