Fast BVH construction on GPUs

Computer Graphics Forum

Volumn 28, Issue 2, 2009, Pages 375-384

  Lauterbach, C ^a   Garland, M ^b   Sengupta, S ^c   Luebke, D ^b   Manocha, D ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b NVIDIA   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

OPTIMIZATION; PROGRAM PROCESSORS; SCALABILITY; COMPUTER GRAPHICS; COMPUTER GRAPHICS EQUIPMENT; GRAPHICS PROCESSING UNIT;

BOUNDING VOLUME HIERARCHIES; CONSTRUCTION PERFORMANCE; CONSTRUCTION PROCESS; HYBRID ALGORITHMS; MULTI-CORE SYSTEMS; PARALLEL SCALABILITY; SURFACE AREA HEURISTIC; TOP DOWN APPROACHES;

RAY TRACING;

EID: 63449109979     PISSN: 01677055     EISSN: 14678659     Source Type: Journal    
DOI: 10.1111/j.1467-8659.2009.01377.x     Document Type: Article

References (34)

1. Ajmera P., Goradia R., Chandran S., Aluru S. : Fast, parallel, gpu-based construction of space filling curves and octrees. In SI3D 1908: Proceedings of the 2008 symposium on Interactive 3D graphics and games (New York, NY, USA, 2008 ACM, pp. 1 1.
2. Carr N. A., Hoberock J., Crane K., Hart J. C. : Fast GPU ray tracing of dynamic meshes using geometry images. In GI 1906: Proceedings of Graphics Interface 2006 (Toronto, Ont., Canada, Canada, 2006 Canadian Information Processing Society, pp. 203 209.
3. Carr N. A., Hall J. D., Hart J. C. : The Ray Engine. In HWWS 1902: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Conference on Graphics Hardware (Aire-la-Ville, Switzerland, Switzerland, 2002 Eurographics Association, pp. 37 46.
4. Ernst M., Greiner G. : Early split clipping for bounding volume hierarchies. In Proc. IEEE Symposium on Interactive Ray Tracing (2007).
5. Ericson C. : Real-Time Collision Detection. Morgan Kaufmann, 2004.
6. Foley T., Sugerman J. : KD-tree acceleration structures for a GPU raytracer. In HWWS 1905: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Conference on Graphics Hardware (New York, NY, USA, 2005 ACM, pp. 15 22.
7. Govindaraju N., Gray J., Kumar R., Manocha D. : GPUTeraSort: High performance graphics coprocessor sorting for large database management. Proc. of ACM SIGMOD (2006).
8. Govindaraju N., Knott D., Jain N., Kabal I., Tamstorf R., Gayle R., Lin M., Manocha D. : Collision detection between deformable models using chromatic decomposition. ACM Trans. on Graphics (Proc. of ACM SIGGRAPH) 24, 3 (2005 991 999.
9. Geimer M., Müller S. : A Cross-Platform Framework for Interactive Ray Tracing. In Graphiktag im Rahmen der GI Jahrestagung (Frankfurt am Main, 2003).
10. Günther J., Popov S., Seidel H.-P., Slusallek P. : Realtime Ray Tracing on GPU with BVH-based Packet Traversal. In Proceedings of the IEEE/Eurographics Symposium on Interactive Ray Tracing 2007 (2007 pp. 113-118.
11. Goldsmith J., Salmon J. : Automatic creation of object hierarchies for ray tracing. IEEE Comput. Graph. Appl. 7, 5 (1987 14 20.
12. Havran V. : Heuristic Ray Shooting Algorithms. PhD thesis, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague, November 2000.
13. Hunt W., Mark W. R., Stoll G. : Fast kd-tree construction with an adaptive error-bounded heuristic. In 2006 IEEE Symposium on Interactive Ray Tracing (September 2006 IEEE.
14. Horn D. : Stream reduction operations for gpgpu applications. GPU Gems 2 (2005).
15. Horn D. R., Sugerman J., Houston M., Hanrahan P. : Interactive k-d tree GPU raytracing. In I3D 1907: Proceedings of the 2007 symposium on Interactive 3D graphics and games (New York, NY, USA, 2007 ACM, pp. 167 174.
16. Lindholm E., Nickolls J., Oberman S., Montrym J. : NVIDIA Tesla: A unified graphics and computing architecture. IEEE Micro 28, 2 (2008 39 55.
17. Lauterbach C., Yoon S., Tuft D., Manocha D. : RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs. IEEE Symposium on Interactive Ray Tracing (2006).
18. MacDonald J. D., Booth K. S. : Heuristics for ray tracing using space subdivision. Visual Computer (1990).
19. Nickolls J., Buck I., Garland M., Skadron K. : Scalable parallel programming with CUDA. Queue 6, 2 (2008 40 53.
20. Purcell T. J., Buck I., Mark W. R., Hanrahan P. : Ray tracing on programmable graphics hardware. In SIGGRAPH 1902: Proceedings of the 29th annual conference on Computer graphics and interactive techniques (New York, NY, USA, 2002 ACM Press, pp. 703 712.
21. Pascucci V., Frank R. J. : Global static indexing for real-time exploration of very large regular grids. Super Computing (2001).
22. Popov S., Günther J., Seidel H.-P., Slusallek P. : Experiences with streaming construction of SAH KD-trees. In Proceedings of the 2006 IEEE Symposium on Interactive Ray Tracing (Sept. 2006 pp. 89 94.
23. Popov S., Günther J., Seidel H.-P., Slusallek P. : Stackless KD-Tree Traversal for High Performance GPU Ray Tracing. Computer Graphics Forum (Proc. EUROGRAPHICS) 26, 3 (2007 415 424.
24. Roger D., Assarsson U., Holzschuch N. : Whitted Ray-Tracing for Dynamic Scenes using a Ray-Space Hierarchy on the GPU. In Rendering Techniques 2007 (Proceedings of the Eurographics Symposium on Rendering) (June 2007 Kautz J., Pattanaik S. Eds.), Eurographics and ACM/SIGGRAPH, the Eurographics Association, pp. 99 110.
25. Rubin S. M., Whitted T. : A 3-dimensional representation for fast rendering of complex scenes. Computer Graphics 14, 3 (July 1980 110 116.
26. Satish N., Harris M., Garland M. : Designing efficient sorting algorithms for manycore GPUs. Under review (2008).
27. Shevtsov M., Soupikov A., Kapustin A. : Highly parallel fast KD-tree construction for interactive ray tracing of dynamic scenes. Computer Graphics Forum 26, 3 (September 2007 395 404.
28. Thrane N., Simonsen L.-O. : A comparison of acceleration structures for GPU assisted ray tracing. Master's thesis, University of Aarhus, Aarhus, Denmark, 2005.
29. Wald I. : On fast Construction of SAH based Bounding Volume Hierarchies. In Proceedings of the 2007 Eurographics/IEEE Symposium on Interactive Ray Tracing (2007).
30. Wald I., Boulos S., Shirley P. : Ray Tracing Deformable Scenes using Dynamic Bounding Volume Hierarchies. ACM Transactions on Graphics 26, 1 (2007).
31. Wald I., Havran V. : On building fast kd-trees for ray tracing, and on doing that in O(N log N). In Proc. of IEEE Symp. on Interactive Ray Tracing (2006 pp. 61 69.
32. Wächter C., Keller A. : Instant Ray Tracing: The Bounding Interval Hierarchy. In Rendering Techniques 2006: Eurographics Symposium on Rendering. (2006).
33. Zhou K., Gong M., Huang X., Guo B. : Highly Parallel Surface Reconstruction. Tech. Rep. MSR-TR-2008-53, Microsoft Technical Report, April 2008.
34. Zhou K., Hou Q., Wang R., Guo B. : Real-time kd-tree construction on graphics hardware. In Proc. SIGGRAPH Asia, to appear (2008).