Parallel sah k-D tree construction

High-Performance Graphics - ACM SIGGRAPH / Eurographics Symposium Proceedings, HPG

Volumn , Issue , 2010, Pages 77-86

  Choi, Byn ^a   Komuravelli, Rakesh ^a   Lu, Victor ^a   Sung, Hyojin ^a   Bocchino, Robert L ^a   Adve, Sarita V ^a   Hart, John C ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); FORESTRY; INTERACTIVE COMPUTER GRAPHICS; RAY TRACING; RENDERING (COMPUTER GRAPHICS);

ACCELERATION DATA; COST OPTIMIZATION; FAST RAY TRACING; INTERSECTION OPERATION; MULTI-CORE SYSTEMS; OPTIMIZED K-D TREE; PARALLEL SCALABILITY; VISUAL COMPUTING;

TREES (MATHEMATICS);

EID: 84995650305     PISSN: 20798679     EISSN: 20798687     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. AMDAHL G. M.: Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities. In Proc. Spring Joint Computer Conf. (1967), pp. 483-485.
2. BENTHIN C.: Realtime Ray Tracing on Current CPU Architectures. PhD thesis, Saarland University, 2006.
3. BLELLOCH G. E., HARDWICK J. C., CHATTERJEE S., SIPELSTEIN J., ZAGHA M.: Implementation of a Portable Nested Data-parallel Language. In Proc. Symp. On Principles and Practice of Parallel Programming (1993), pp. 102-111.
4. BLUMOFE R. D., JOERG C. F., KUSZMAUL B. C., LEISERSON C. E., RANDALL K. H., ZHOU Y.: Cilk: An Efficient Multithreaded Runtime System. 207-216.
5. BLELLOCH G. E.: NESL: A Nested Data-Parallel Language. Tech. Rep., Pittsburgh, PA, USA, 1995.
6. CARR N. A., HOBEROCK J., CRANE K., HART J. C.: Fast GPU Ray Tracing of Dynamic Meshes using Geometry Images. In Proc. Graphics Interface (2006), pp. 203-209.
7. GOVINDARAJU V., DJEU P., SANKARALINGAM K., VERNON M., MARK W. R.: Toward a Multicore Architecture for Real-Time Ray-Tracing. In Proc. Intl. Symp. On Microarchitecture (2008), pp. 176-187.
8. GODIYAL A., HOBEROCK J., GARLAND M., HART J. C.: Rapid Multipole Graph Drawing on the GPU. In Proc. Graph Drawing (2008), pp. 90-101.
9. GAMMA E., HELM R., JOHNSON R., VLISSIDES J.: Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, 1995.
10. GREENE N., KASS M., MILLER G.: Hierarchical Zbuffer Visibility. In Proc. SIGGRAPH (1993), pp. 231-238.
11. GOLDSMITH J., SALMON J.: Automatic Creation of Object Hierarchies for Ray Tracing. IEEE Computer Graphics and Applications 7, 5 (1987), 14-20.
12. HAVRAN V.: Heuristic Ray Shooting Algorithms. Ph.d. 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 k-D Tree Construction with an Adaptive Error-Bounded Heuristic. In Proc. Interactive Ray Tracing (2006), pp. 81-88.
14. HILLIS W. D., STEELE JR. G. L.: Data Parallel Algorithms. CACM 29, 12 (1986), 1170-1183.
15. INTEL: Intel (R) Threading Building Block Manual, 2009. Document number 315415-001US.
16. LAUTERBACH C., GARLAND M., SENGUPTA S., LUEBKE D., MANOCHA D.: Fast BVH Construction on GPUs. Computer Graphics Forum 28, 2 (2009), 375-384.
17. LUEBKE D., PARKER S.: Interactive Ray Tracing with CUDA. Tech. Rep., 2008.
18. MACDONALD J. D., BOOTH K. S.: Heuristics for Ray Tracing using Space Subdivision. Visual Computer 6, 3 (1990), 153-65.
19. MATTSON T. G., SANDERS B. A., MASSINGILL B. L.: Patterns for Parallel Programming. Addison-Wesley, 2004.
20. POPOV S., GÜNTHER J., SEIDEL H.-P., SLUSALLEK P.: Experiences with Streaming Construction of SAH KD-Trees. In Proc. Interactive Ray Tracing (2006), pp. 89-94.
21. STEPHENS A., BOULOS S., BIGLER J., WALD I., PARKER S.: An Application of Scalable Massive Model Interaction using Shared Memory Systems. In Proc. EG Symp. On Parallel Graphics and Vis. (2006), pp. 19-26.
22. SEILER L., CARMEAN D., SPRANGLE E., FORSYTH T., ABRASH M., DUBEY P., JUNKINS S., LAKE A., SUGERMAN J., CAVIN R., ESPASA R., GROCHOWSKI E., JUAN T., HANRAHAN P.: Larrabee: A Many-core x86 Architecture for Visual Computing. ACM Trans. Graph. 27, 3 (2008), 18:1-18:15.
23. SHEVTSOV M., SOUPIKOV A., KAPUSTIN A.: Highly Parallel Fast k-D Tree Construction for Interactive Ray Tracing of Dynamic Scenes. Computer Graphics Forum 26, 3 (2007), 395-404.
24. WALD I.: On Fast Construction of SAH based Bounding Volume Hierarchies. In Proc. Interactive Ray Tracing (2007).
25. WALD I., BOULOS S., SHIRLEY P.: Ray Tracing Deformable Scenes using Dynamic Bounding Volume Hierarchies. ACM Trans. Graph. 26, 1 (2007), 6.
26. WALD I., HAVRAN V.: On Building Fast k-D Trees for Ray Tracing and On Doing That in O(NlogN). In Proc. Interactive Ray Tracing (2006), pp. 61-69.
27. WEGHORST H., HOOPER G., GREENBERG D. P.: Improved Computational Methods for Ray Tracing. ACM Trans. Graph. 3, 1 (1984), 52-69.
28. WALD I., IZE T., PARKER S. G.: Fast, Parallel, and Asynchronous Construction of BVHs for Ray Tracing Animated Scenes. Computers & Graphics 32, 1 (2008), 3-13.
29. WOOP S., SCHMITTLER J., SLUSALLEK P.: RPU: A Programmable Ray Processing Unit for Realtime Ray Tracing. ACM Trans. Graph. 24, 3 (2005), 434-444.
30. ZHOU K., HOU Q., WANG R., GUO B.: Real-time k-D Tree Construction on Graphics Hardware. In Proc. SIGGRAPH Asia (2008), vol. 27, pp. 1-11.