Hybrid CPU/GPU KD-Tree Construction for Versatile Ray Tracing

Figure 3 shows the traversal and construction times as well as the memory footprint of the Split Grid in comparison to the kd-tree, BVH and the classic grid for the scenes shown

To evaluate the performance of our streamed binning construction algorithms for kd-tree and BVH we compare them to the conventional construction algorithms in terms of the time

Computer Graphics Forum c 2015 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley &

Computer Graphics Forum c 2017 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley &

2017 The Author(s) Computer Graphics Forum c 2017 The Eurographics Association and John Wiley & Sons Ltd..c. Berkiten

2017 The Author(s) Computer Graphics Forum c 2017 The Eurographics Association and John Wiley & Sons Ltd... Harada / Stochastic Light Culling for VPLs on GGX

Computer Graphics Forum c 2018 The Eurographics Association and John Wiley & Sons Ltd. Published by John Wiley &

2018 The Author(s) Computer Graphics Forum c 2018 The Eurographics Association and John Wiley &