Stackless KD-Tree traversal for high performance GPU ray tracing

被引:115
作者
Popov, Stefan [1 ]
Guenther, Johannes
Seidel, Hans-Peter
Slusallek, Philipp
机构
[1] Univ Saarland, D-6600 Saarbrucken, Germany
[2] MPI Informat, Saarbrucken, Germany
关键词
D O I
10.1111/j.1467-8659.2007.01064.x
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Significant advances have been achieved for realtime ray tracing recently, but realtime performance for complex scenes still requires large computational resources not yet available from the CPUs in standard PCs. Incidentally, most of these PCs also contain modern GPUs that do offer much larger raw compute power However limitations in the programming and memory model have so far kept the performance of GPU ray tracers well below that of their CPU counterparts. In this paper we present a novel packet ray traversal implementation that completely eliminates the need for maintaining a stack during kd-tree traversal and that reduces the number of traversal steps per ray. While CPUs benefit moderately from the stackless approach, it improves GPU performance significantly. We achieve a peak performance of over 16 million rays per second,for reasonably complex scenes, including complex shading and secondary rays. Several examples show that with this new technique GPUs can actually outperform equivalent CPU based ray tracers.
引用
收藏
页码:415 / 424
页数:10
相关论文
共 34 条
[1]  
[Anonymous], P 14 SPRING C COMP G
[2]  
[Anonymous], 2001, THESIS CZECH TU PRAG
[3]  
BENTHIN C, 2006, REALTIME RAY TRACING
[4]  
BOULOS S, 2007, P GRAPH INT 2007 MAY
[5]  
CARR NA, 2006, P GRAPHICS INTERFACE
[6]  
Carr NathanA., 2002, P ACM SIGGRAPHEUROGR, P37
[7]  
CHRISTEN M, 2005, THESIS FACHHOCHSCHUL
[8]  
ERNST M, 2004, P VIS MOD VIS, P255
[9]  
FOLEY T., 2005, HWWS 05, P15, DOI DOI 10.1145/1071866.1071869
[10]  
FORTUNE S, 1978, STOC 78, P114