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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Faster Ray Tracing through Hierarchy Cut Code

MeiZhi Liu, Qilong Kou, Dan Li, Fengqi Liu et al.
2 citations
Computer Graphics Forum
Computer Graphics and Visualization Techniques
1.26
article

Faster Ray Tracing through Hierarchy Cut Code

MeiZhi Liu, Qilong Kou, Dan Li, Fengqi Liu, WeiLai Xiang, PengZhan Xu, Zaonan Tan
article en
2 citations

Abstract

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.

Computer Graphics ForumVol. 43(7)
Tencent (China) (CN), Huazhong University of Science and Technology (CN)
Innovative Research Group Project of the National Natural Science Foundation of China, National Key Research and Development Program of China
Openalex Percentile: Top 12%
Computer Graphics and Visualization Techniques
1.26
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Faster Ray Tracing through Hierarchy Cut Code — MeiZhi Liu, Qilong Kou, et al. · Computer Graphics Forum (2024) | TGRS Research Map | TGRS