Faster Ray Tracing through Hierarchy Cut Code
We propose a novel ray reordering technique to accelerate the ray tracing process by encoding and sorting rays prior to traversal. Instead of spatial coordinates, our method encodes rays according to the cuts of the hierarchical acceleration structure, which is called the hierarchy cut code. This ap...
Gespeichert in:
Hauptverfasser: | , , , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We propose a novel ray reordering technique to accelerate the ray tracing
process by encoding and sorting rays prior to traversal. Instead of spatial
coordinates, our method encodes rays according to the cuts of the hierarchical
acceleration structure, which is called the hierarchy cut code. This approach
can better adapt to the acceleration structure and obtain a more reliable
encoding result. We also propose a compression scheme to decrease the sorting
overhead by a shorter sorting key. In addition, based on the phenomenon of
boundary drift, we theoretically explain the reason why existing reordering
methods cannot achieve better performance by using longer sorting keys. The
experiment demonstrates that our method can accelerate secondary ray tracing by
up to 1.81 times, outperforming the existing methods. Such result proves the
effectiveness of hierarchy cut code, and indicate that the reordering technique
can achieve greater performance improvement, which worth further research. |
---|---|
DOI: | 10.48550/arxiv.2305.16652 |