A parallel algorithm for construction of uniform grids

We present a fast, parallel GPU algorithm for construction of uniform grids for ray tracing, which we implement in CUDA. The algorithm performance does not depend on the primitive distribution, because we reduce the problem to sorting pairs of primitives and cell indices. Our implementation is able to take full advantage of the parallel architecture of the GPU, and construction speed is faster than CPU algorithms running on multiple cores. Its scalability and robustness make it superior to alternative approaches, especially for scenes with complex primitive distributions.

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

[2]  Olivier Devillers Méthodes d'optimisation du tracé de rayons , 1988 .

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

[4]  Veysi Isler,et al.  Accelerated regular grid traversals using extended anisotropic chessboard distance fields on a parallel stream processor , 2007, J. Parallel Distributed Comput..

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

[6]  Pat Hanrahan,et al.  Ray tracing on programmable graphics hardware , 2002, SIGGRAPH Courses.

[7]  P. J. Narayanan,et al.  Ray Casting Deformable Models on the GPU , 2008, 2008 Sixth Indian Conference on Computer Vision, Graphics & Image Processing.

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

[9]  John Amanatides,et al.  A Fast Voxel Traversal Algorithm for Ray Tracing , 1987, Eurographics.

[10]  I. Wald,et al.  An Evaluation of Parallel Grid Construction for Ray Tracing Dynamic Scenes , 2006, 2006 IEEE Symposium on Interactive Ray Tracing.

[11]  Elmar Eisemann,et al.  Fast scene voxelization and applications , 2006, I3D '06.

[12]  Kevin Skadron,et al.  Scalable parallel programming , 2008, 2008 IEEE Hot Chips 20 Symposium (HCS).

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

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

[15]  Yao Zhang,et al.  Scan primitives for GPU computing , 2007, GH '07.

[16]  Brian Wyvill,et al.  ADAPTIVE VOXEL SUBDIVISION FOR RAY TRACING , 1988 .

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

[18]  H.-P. Seidel,et al.  Realtime Ray Tracing on GPU with BVH-based Packet Traversal , 2007, 2007 IEEE Symposium on Interactive Ray Tracing.

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

[20]  Hans-Peter Seidel,et al.  EUROGRAPHICS 2007 / D. Cohen-Or and P. Slavík (Guest Editors) Stackless KD-Tree Traversal for High Performance GPU Ray Tracing , 2022 .