arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2305.16652cs.GR
收藏

通过层级切割码实现更快的光线追踪

Faster Ray Tracing through Hierarchy Cut Code

WeiLai Xiang, FengQi Liu, Dan Li, ZhaoNan Tan, PengZhan Xu, MeiZhi Liu, QiLong Kou

AI总结:

本研究提出基于层级切割码的光线重排序技术,结合压缩方案降低排序开销,从理论解释长排序键性能瓶颈,实验实现次级光线追踪最高1.81倍加速,优于现有方法。

摘要:

我们提出了一种新颖的光线重排序技术,通过在遍历前对光线进行编码与排序来加速光线追踪流程。本方法并非基于空间坐标,而是根据层级加速结构的切割对光线进行编码,该编码被称为层级切割码(hierarchy cut code)。这种方式能够更好地适配加速结构,获得更可靠的编码结果。我们还提出了一种压缩方案,通过更短的排序键降低排序开销。此外,基于边界漂移现象,我们从理论上解释了现有重排序方法无法通过使用更长排序键获得更优性能的原因。实验表明,本方法可将次级光线追踪速度最高提升1.81倍,性能优于现有方法。该结果证明了层级切割码的有效性,同时表明重排序技术能够实现更大的性能提升,值得进一步研究。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑