Architecture considerations for tracing incoherent rays

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

Volumn , Issue , 2010, Pages 113-122

  Karras, Timo Aila Tero ^a  

^a NVIDIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; HARDWARE; HEURISTIC ALGORITHMS; INTERACTIVE COMPUTER GRAPHICS; SCHEDULING ALGORITHMS; THREE DIMENSIONAL COMPUTER GRAPHICS;

ACCELERATION STRUCTURES; ARBITRARY ORDER; DESCRIPTORS; GLOBAL ILLUMINATION; I.3.1 [COMPUTER GRAPHICS]: HARDWARE ARCHITECTURE - GRAPHICS PROCESSORS; I.3.7 [COMPUTER GRAPHICS]: THREE-DIMENSIONAL GRAPHICS AND REALISM - RAYTRACING; MASSIVELY PARALLELS; MEMORY BANDWIDTHS;

COMPUTER HARDWARE;

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

References (21)

1. AILA T., LAINE S.: Understanding the efficiency of ray traversal on GPUs. In Proc. High-Performance Graphics 2009 (2009), pp. 145-149.
2. DAMMERTZ H., HANIKA J., KELLER A.: Shallow bounding volume hierarchies for fast SIMD ray tracing of incoherent rays. Comp. Graph. Forum 27, 4 (2008), 1225-1234.
3. HALTON J.: On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals. Numerische Mathematik 2, 1 (1960), 84-90.
4. HORN D. R., SUGERMAN J., HOUSTON M., HANRAHAN P.: Interactive k-d tree GPU raytracing. In Proc. Symposium on Interactive 3D graphics and games (2007), ACM, pp. 167-174.
5. KARRENBERG R.: Memory aware realtime ray tracing: The bounding plane hierarchy. Bachelor thesis, Saarland University, 2007.
6. KIM T.-J., MOON B., KIM D., YOON S.-E.: RACBVHs: random-accessible compressed bounding volume hierarchies. In ACM SIGGRAPH '09: Posters (2009), pp. 1-1.
7. KRASHINSKY R. M.: Vector-Thread Architecture And Implementation. PhD thesis, MIT, 2007.
8. LALONDE P.: Innovating in a software graphics pipeline. ACM SIGGRAPH 2009 course: Beyond programmable shading, 2009.
9. LAUTERBACH C., YOON S.-E., MANOCHA D.: Raystrips: A compact mesh representation for interactive ray tracing. In Proc. IEEE Symposium on Interactive Ray Tracing 2007 (2007), pp. 19-26.
10. NAVRATIL P. A., FUSSELL D. S., LIN C., MARK W. R.: Dynamic ray scheduling to improve ray coherence and bandwidth utilization. In Proc. IEEE Symposium on Interactive Ray Tracing 2007 (2007), pp. 95-104.
11. NVIDIA: NVIDIA CUDA Programming Guide Version 2.1. 2008.
12. NVIDIA: Nvidia's next generation CUDA compute architecture: Fermi. Whitepaper, 2010.
13. PHARR M., KOLB C., GERSHBEIN R., HANRAHAN P.: Rendering complex scenes with memory-coherent ray tracing. In Proc. ACM SIGGRAPH 97 (1997), pp. 101-108.
14. RAMANI K., GRIBBLE C. P., DAVIS A.: Streamray: a stream filtering architecture for coherent ray tracing. In ASPLOS '09: Proc. 14th International Conference on Architectural Support for Programming Languages and Operating Systems (2009), ACM, pp. 325-336.
15. SUGERMAN J., FATAHALIAN K., BOULOS S., AKELEY K., HANRAHAN P.: Gramps: A programming model for graphics pipelines. ACM Trans. Graph. 28, 1 (2009), 1-11.
16. SMITS B.: Efficiency issues for ray tracing. J. Graph. Tools 3, 2 (1998), 1-14.
17. SCHMITTLER J., WALD I., SLUSALLEK P.: Saarcor: a hardware architecture for ray tracing. In Proc. ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2002), pp. 27-36.
18. SCHMITTLER J., WOOP S., WAGNER D., PAUL W. J., SLUSALLEK P.: Realtime ray tracing of dynamic scenes on an FPGA chip. In Proc. ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2004), pp. 95-106.
19. WALD I., BENTHIN C., BOULOS S.: Getting rid of packets: Efficient SIMD single-ray traversal using multibranching BVHs. In Proc. IEEE/Eurographics Symposium on Interactive Ray Tracing 2008 (2008), pp. 49-57.
20. WÄCHTER C., KELLER A.: Instant ray tracing: The bounding interval hierarchy. In Proc. Eurographics Symposium on Rendering 2006 (2006), pp. 139-149.
21. WOOP S., SCHMITTLER J., SLUSALLEK P.: RPU: a programmable ray processing unit for realtime ray tracing. ACM Trans. Graph. 24, 4 (2005), 434-444.