Implicit and Dynamic Trees for High Performance Rendering

摘要

Recent advances in GPU architecture and programmability have en abled the computation of ray casted or ray traced images at inter active frame rates. However, the rapid performance gains of the hardware cannot by themselves address the challenge posed by the steady growth in the geometric and temporal complexity of com puter graphics datasets. In this paper we present a novel versatile tree data structure that can accommodate both sparse and dense data sets and is more memory efficient than state-of-the-art representa tions. A key feature of our data structure for rendering applications is that it fully supports efficient, parallel building. As a result, our implicit tree representation significantly outperforms existing tech niques in the rendering of time-varying scenes. We show how this data structure can be extended to encode other classic representa tions such as BSP-trees and we discuss the high-performance im plementation of our general approach on the GPU.