Instant ray tracing: the bounding interval hierarchy

We introduce a new ray tracing algorithm that exploits the best of previous methods: Similar to bounding volume hierarchies the memory of the acceleration data structure is linear in the number of objects to be ray traced and can be predicted prior to construction, while the traversal of the hierarchy is as efficient as the one of kd-trees. The construction algorithm can be considered a variant of quicksort and for the first time is based on a global space partitioning heuristic, which is much cheaper to evaluate than the classic surface area heuristic. Compared to spatial partitioning schemes only a fraction of the memory is used and a higher numerical precision is intrinsic. The new method is simple to implement and its high performance is demonstrated by extensive measurements including massive as well as dynamic scenes, where we focus on the total time to image including the construction cost rather than on only frames per second.

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

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

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

[4]  Roman Kuchkuda,et al.  An introduction to ray tracing , 1993, Comput. Graph..

[5]  Alain Fournier,et al.  A Ray Tracing Accelerator Based on a Hierarchy of 1D Sorted Lists , 1992 .

[6]  Alexander Keller,et al.  Quasi-Monte Carlo methods for photorealistic image synthesis , 1998, Beiträge zur Informatik.

[7]  Peter-Pike J. Sloan,et al.  Interactive ray tracing , 1999, SI3D.

[8]  Peter Shirley,et al.  Realistic ray tracing , 2000 .

[9]  Erik Reinhard,et al.  Dynamic Acceleration Structures for Interactive Ray Tracing , 2000, Rendering Techniques.

[10]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

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

[12]  Markus Wagner,et al.  Interactive Distributed Ray Tracing of Highly Complex Models , 2001, Rendering Techniques.

[13]  Alexander Keller,et al.  Strictly Deterministic Sampling Methods in Computer Graphics , 2001 .

[14]  M. Geimer,et al.  A Cross-Platform Framework for Interactive Ray Tracing , 2003 .

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

[16]  P. Slusallek,et al.  RPU: a programmable ray processing unit for realtime ray tracing , 2005, ACM Trans. Graph..

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

[18]  Philipp Slusallek,et al.  An interactive out-of-core rendering framework for visualizing massively complex models , 2004, Rendering Techniques.

[19]  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.

[20]  Carsten Benthin,et al.  Realtime ray tracing on current CPU architectures , 2006 .

[21]  Ingo Wald,et al.  Ray tracing animated scenes using coherent grid traversal , 2006, ACM Trans. Graph..

[22]  Ingo Wald,et al.  An application of scalable massive model interaction using shared-memory systems , 2006, EGPGV '06.

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