Naive ray-tracing: A divide-and-conquer approach

We present an efficient ray-tracing algorithm which, for the first time, does not store any data structures when performing spatial subdivisions, and directly computes intersections inside the scene. This new algorithm is often faster than comparable ray-tracing methods at rendering dynamic scenes, and has a similar level of performance when compared to static ray-tracers. Memory management is made minimal and deterministic, which simplifies ray-tracing engineering, as spatial subdivision data structures are no longer considered in the graphics pipeline. This is possible with a modification of Whitted's naive ray-tracing algorithm by using a divide-and-conquer approach, and by having a sufficient collection of rays in order to reduce the complexity of naive ray-tracing. In particular, the algorithm excels at spontaneously solving large Ray/Primitive intersection problems.

[1]  John A. Tsakok.  Faster incoherent rays: Multi-BVH ray stream tracing , 2009, High Performance Graphics.

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

[3]  Alexander Keller,et al.  Efficient Ray Tracing without Auxiliary Acceleration Data Structure , 2011 .

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

[5]  Tomas Akenine-Möller.  Fast 3D Triangle-Box Overlap Testing , 2001, J. Graphics, GPU, & Game Tools.

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

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

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

[9]  Alexander Reshetov,et al.  Multi-level ray tracing algorithm , 2005, ACM Trans. Graph..

[10]  John Amanatides,et al.  Ray tracing with cones , 1984, SIGGRAPH.

[11]  Turner Whitted,et al.  An improved illumination model for shaded display , 1979, CACM.

[12]  Turner Whitted,et al.  A 3-dimensional representation for fast rendering of complex scenes , 1980, SIGGRAPH '80.

[13]  Ravi Ramamoorthi,et al.  A Real-time Beam Tracer with Application to Exact Soft Shadows , 2007, Rendering Techniques.

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

[15]  Koji Nakamaru,et al.  Breadth-First Ray Tracing Utilizing Uniform Spatial Subdivision , 1997, IEEE Trans. Vis. Comput. Graph..

[16]  W. Mark,et al.  Ray-specialized acceleration structures for ray tracing , 2008, 2008 IEEE Symposium on Interactive Ray Tracing.

[17]  Alexander Keller,et al.  Instant radiosity , 1997, SIGGRAPH.

[18]  John Hart,et al.  ACM Transactions on Graphics , 2004, SIGGRAPH 2004.

[19]  A. Reshetov.  Omnidirectional Ray Tracing Traversal Algorithm for kd-trees , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[20]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[21]  Andrew S. Glassner,et al.  Space subdivision for fast ray tracing , 1984, IEEE Computer Graphics and Applications.

[22]  Nicolas Holzschuch,et al.  Whitted Ray-Tracing for Dynamic Scenes using a Ray-Space Hierarchy on the GPU , 2007, Rendering Techniques.

[23]  Philipp Slusallek,et al.  Realtime ray tracing of dynamic scenes on an FPGA chip , 2004, Graphics Hardware.

[24]  W.R. Mark,et al.  Adaptive acceleration structures in perspective space , 2008, 2008 IEEE Symposium on Interactive Ray Tracing.

[25]  John Tsakok.  Fast Ray Tracing Techniques , 2008 .

[26]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[27]  Ares Lagae,et al.  Compact, Fast and Robust Grids for Ray Tracing , 2008, Comput. Graph. Forum.

[28]  Geoff Wyvill,et al.  Analysis of an algorithm for fast ray tracing using uniform space subdivision , 1988, The Visual Computer.

[29]  Morgan McGuire,et al.  Hardware-accelerated global illumination by image space photon mapping , 2009, High Performance Graphics.

[30]  Charles T. Loop,et al.  Fast Ray Sorting and Breadth‐First Packet Traversal for GPU Ray Tracing , 2010, Comput. Graph. Forum.

[31]  Takayuki Tanaka,et al.  ARTS: Accelerated Ray-Tracing System , 1986, IEEE Computer Graphics and Applications.

[32]  P. Shirley,et al.  Grid Creation Strategies for Efficient Ray Tracing , 2007, 2007 IEEE Symposium on Interactive Ray Tracing.

[33]  Aaron Knoll,et al.  Ray tracing animated scenes using coherent grid traversal , 2006, SIGGRAPH 2006.

[34]  Alexander Keller,et al.  Instant ray tracing: the bounding interval hierarchy , 2006, EGSR '06.

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

[36]  A. Keller,et al.  Terminating Spatial Hierarchies by A Priori Bounding Memory , 2007, 2007 IEEE Symposium on Interactive Ray Tracing.

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

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

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

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

[41]  Steve Marschner,et al.  A practical model for subsurface light transport , 2001, SIGGRAPH.

[42]  W.R. Mark,et al.  Fast kd-tree Construction with an Adaptive Error-Bounded Heuristic , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[43]  James T. Kajiya,et al.  The rendering equation , 1998 .