Stackless KD-Tree traversal for high performance GPU ray tracing

被引:113
|
作者
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
相关论文
共 50 条
  • [1] Review: Kd-tree Traversal Algorithms for Ray Tracing
    Hapala, M.
    Havran, V.
    COMPUTER GRAPHICS FORUM, 2011, 30 (01) : 199 - 213
  • [2] kD-Tree Traversal Implementations for Ray Tracing on Massive Multiprocessors: a Comparative Study
    dos Santos, Artur L.
    Teixeira, Joao Marcelo X. N.
    de Farias, Thiago S. M. C.
    Teichrieb, Veronica
    Kelner, Judith
    PROCEEDINGS OF THE 21ST INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING, 2009, : 41 - 48
  • [3] Ultrafast ray tracing for electromagnetics via kD-tree and BVH on GPU
    Breglia, Alfonso
    Capozzoli, Amedeo
    Curcio, Claudio
    Liseno, Angelo
    2015 31ST INTERNATIONAL REVIEW OF PROGRESS IN APPLIED COMPUTATIONAL ELECTROMAGNETICS (ACES) VOL 31, 2015,
  • [4] kd-Tree Traversal Techniques
    Tsakok, John A.
    Bishop, William
    Kennings, Andrew
    RT08: IEEE/EG SYMPOSIUM ON INTERACTIVE RAY TRACING 2008, PROCEEDINGS, 2008, : 190 - 190
  • [5] Stackless Multi-BVH Traversal for CPU, MIC and GPU Ray Tracing
    Afra, Attila T.
    Szirmay-Kalos, Laszlo
    COMPUTER GRAPHICS FORUM, 2014, 33 (01) : 129 - 140
  • [6] Research on Parallel KD-Tree Construction for Ray Tracing
    Zhang Peicheng
    Xu Huahu
    Bian Minjie
    Gao Honghao
    INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING, 2016, 9 (11): : 49 - 59
  • [7] Radar simulation with kD-tree on the GPU
    Shi, Kejian
    Wang, Bin
    Zhu, Tianqian
    Zhang, Hui
    Hou, Zhaoguo
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2010, 22 (03): : 440 - 448
  • [8] Kd-tree based fast ray tracing for RCS prediction
    Tao, Y. B.
    Lin, H.
    Bao, H. J.
    PROGRESS IN ELECTROMAGNETICS RESEARCH-PIER, 2008, 81 : 329 - 341
  • [9] Efficient kd-tree construction for ray tracing using ray distribution sampling
    Liang, Xiao
    Yang, Hongyu
    Zhang, Yanci
    Yin, Jun
    Cao, Yue
    MULTIMEDIA TOOLS AND APPLICATIONS, 2016, 75 (23) : 15881 - 15899
  • [10] Efficient kd-tree construction for ray tracing using ray distribution sampling
    Xiao Liang
    Hongyu Yang
    Yanci Zhang
    Jun Yin
    Yue Cao
    Multimedia Tools and Applications, 2016, 75 : 15881 - 15899