MSKD: multi-split KD-tree design on GPU

Xin Yang

doi:10.1007/s11042-014-2371-x

MSKD: multi-split KD-tree design on GPU

2014-11-22

2

PRE

AI

DOI：10.1007/s11042-014-2371-x

Original

Original request for help

Save

Abstract

En 中文

We present a novel parallel acceleration structure construction and traversal algorithm designed to efficiently exploit the massive parallel computing cores on the Graphic Processing Unit(GPU) to improve the render performance. Our associated data structure is called multi-split KD-tree or MSKD, which focuses on fast generating and efficiently traveling multiple child nodes hierarchy in parallel. At build-time, we introduce a multi-split node generation method to split along three-dimension axes into eight child nodes once, and gather quickly high-quality child nodes even at early construction phase. During traversal, we propose a progressive traversal to fast decide the visiting order for multiple child nodes. Then, we use a dynamic ray transfer to adaptively drive the traversal tasks execution on the GPU. Our experiments with this hierarchy show the construction and traversal performance improvement for ray tracing using MSKD compared to previous methods.

Keywords:

KD-tree

Acceleration structure

Ray tracing

Graphics hardware

MSKD: multi-split KD-tree design on GPU

Abstract

AI Summary

Journal

Organization