Granular visibility queries on the GPU
University of Stuttgart
In I3D ’09: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009), pp. 161-167
@conference{engelhardt2009granular,
title={Granular visibility queries on the GPU},
author={Engelhardt, T. and Dachsbacher, C.},
booktitle={Proceedings of the 2009 symposium on Interactive 3D graphics and games},
pages={161–167},
year={2009},
organization={ACM}
}
Efficient visibility queries are key in many interactive rendering techniques, such as occlusion culling, level of detail determination, and perceptual rendering. The occlusion query mechanism natively supported by GPUs is carried out for batches of rendered geometry. In this paper, we present two novel ways of determining visibility by intelligently querying summed area tables and computing a variant of item buffers. This enables visibility queries of finer granularity, e.g., for sub-regions of objects and for instances created within a single draw call. Our method determines the visibility of a large number of objects simultaneously which can be used in geometry shaders to cull triangles, or to control the level of detail in geometry and pixel shaders under certain rendering scenarios. We demonstrate the benefits of our method with two different real-time rendering techniques.
November 25, 2010 by hgpu
