Faster Ray Tracing through Hierarchy Cut Code

• Published in: Computer graphics forum 2024-10, Vol.43 (7), p.n/a
• Main Authors: Xiang, WeiLai, Liu, FengQi, Tan, Zaonan, Li, Dan, Xu, PengZhan, Liu, MeiZhi, Kou, QiLong
• Format: Article
• Language: English
• Subjects: CCS Concepts; Coding; Computing methodologies → Ray tracing; Effectiveness; Ray tracing
• ISSN: 0167-7055; 1467-8659
• DOI: 10.1111/cgf.15226

We propose a novel ray reordering technique designed to accelerate the ray tracing process by encoding and sorting rays prior to traversal. Our method, called “hierarchy cut code”, involves encoding rays based on the cuts of the hierarchical acceleration structure, rather than relying solely on spatial coordinates. This approach allows for a more effective adaptation to the acceleration structure, resulting in a more reliable and efficient encoding outcome. Furthermore, our research identifies “bounding drift” as a major obstacle in achieving better acceleration effects using longer sorting keys in existing reordering methods. Fortunately, our hierarchy cut code successfully overcomes this issue, providing improved performance in ray tracing. Experimental results demonstrate the effectiveness of our approach, showing up to a 1.81 times faster secondary ray tracing compared to existing methods. These promising results highlight the potential for further enhancement in the acceleration effect of reordering techniques, warranting further exploration and research in this exciting field.