Faster Ray Tracing through Hierarchy Cut Code
Abstract 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.
Authors
- MeiZhi Liu
- Qilong Kou (ORCID: https://orcid.org/0000-0002-5222-7069)
- Dan Li (ORCID: https://orcid.org/0000-0003-4826-9423)
- Fengqi Liu (ORCID: https://orcid.org/0000-0001-6398-069X)
- WeiLai Xiang
- PengZhan Xu
- Zaonan Tan
Institutions
- Tencent (China) (CN)
- Huazhong University of Science and Technology (CN)
Publication Details
- Journal
- Computer Graphics Forum
- Published
- 2024-10-01
- DOI
- https://doi.org/10.1111/cgf.15226
- Citations
- 2
- Primary Topic
- Computer Graphics and Visualization Techniques
- Type
- article
- Field-Weighted Citation Impact
- 1.26
Funders
- Innovative Research Group Project of the National Natural Science Foundation of China
- National Key Research and Development Program of China