Shallow bounding volume hierarchies for fast SIMD ray tracing of incoherent rays

被引:53
|
作者
Dammertz, H. [1 ]
Hanika, J. [1 ]
Keller, A. [2 ]
机构
[1] Univ Ulm, D-89081 Ulm, Germany
[2] Mental Images GmbH, D-10623 Berlin, Germany
关键词
All Open Access; Green;
D O I
10.1111/j.1467-8659.2008.01261.x
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Photorealistic image synthesis is a computationally demanding task that relies on ray tracing for the evaluation of integrals. Rendering time is dominated by tracing long paths that are very incoherent by construction. We therefore investigate the use of SIMD instructions to accelerate incoherent rays. SIMD is used in the hierarchy construction, the tree traversal and the leaf intersection. This is achieved by increasing the arity of acceleration structures, which also reduces memory requirements. We show that the resulting hierarchies can be built quickly and are smaller than acceleration structures known so far while at the same time outperforming them for incoherent rays. Our new acceleration structure speeds up ray tracing by a factor of 1.6 to 2.0 compared to a highly optimized bounding interval hierarchy implementation, and 1.3 to 1.6 compared to an efficient kd-tree. At the same time, the memory requirements are reduced by 10-50%. Additionally we show how a caching mechanism in conjunction with this memory efficient hierarchy can be used to speed up shadow rays in a global illumination algorithm without increasing the memory footprint. This optimization decreased the number of traversal steps up to 50%.
引用
收藏
页码:1225 / 1233
页数:9
相关论文
共 29 条
  • [1] A Survey on Bounding Volume Hierarchies for Ray Tracing
    Meister, Daniel
    Ogaki, Shinji
    Benthin, Carsten
    Doyle, Michael J.
    Guthe, Michael
    Bittner, Jiri
    [J]. COMPUTER GRAPHICS FORUM, 2021, 40 (02) : 683 - 712
  • [2] An Improved Ray Tracing Acceleration Algorithm Based on Bounding Volume Hierarchies
    Wang, Chen
    Wang, Yinghua
    Li, Yuxiao
    Huang, Jialing
    Huang, Jie
    Wang, Cheng-Xiang
    [J]. 2022 IEEE 96TH VEHICULAR TECHNOLOGY CONFERENCE (VTC2022-FALL), 2022,
  • [3] Efficient construction of bounding volume hierarchies into a complete octree for ray tracing
    Olivares, Ulises
    Rodriguez, Hector G.
    Garcia, Arturo
    Ramos, Felix F.
    [J]. COMPUTER ANIMATION AND VIRTUAL WORLDS, 2016, 27 (3-4) : 358 - 368
  • [4] Ray tracing deformable scenes using dynamic bounding volume hierarchies
    Wald, Ingo
    Boulos, Solomon
    Shirley, Peter
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2007, 26 (01):
  • [5] Using KD-trees to guide bounding volume hierarchies for ray tracing
    Hook, D
    Forward, K
    [J]. AUSTRALIAN COMPUTER JOURNAL, 1995, 27 (03): : 103 - 108
  • [6] SIMDop: SIMD Optimized Bounding Volume Hierarchies for Collision Detection
    Tan, Toni
    Weller, Rene
    Zachmann, Gabriel
    [J]. 2019 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS), 2019, : 7256 - 7263
  • [7] Performance Comparison of Bounding Volume Hierarchies and Kd-Trees for GPU Ray Tracing
    Vinkler, Marek
    Havran, Vlastimil
    Bittner, Jiri
    [J]. COMPUTER GRAPHICS FORUM, 2016, 35 (08) : 68 - 79
  • [8] Ray Specialized Contraction on Bounding Volume Hierarchies
    Gu, Yan
    He, Yong
    Blelloch, Guy E.
    [J]. COMPUTER GRAPHICS FORUM, 2015, 34 (07) : 309 - 318
  • [9] Efficient ray sorting for the tracing of incoherent rays
    Nah, Jae-Ho
    Jung, Yun-Hye
    Park, Woo-Chan
    Han, Tack-Don
    [J]. IEICE ELECTRONICS EXPRESS, 2012, 9 (09): : 849 - 854
  • [10] Hybrid bounding volume hierarchies for fast proximity queries
    Kim, DH
    Choi, HS
    [J]. ICMIT 2005: INFORMATION SYSTEMS AND SIGNAL PROCESSING, 2005, 6041