Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful
No Thumbnail Available
Date
2004
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association and Blackwell Publishing, Inc
Abstract
We present a simple but powerful algorithm for optimizing the usage of hardware occlusion queries in arbitrary complex scenes. Our method minimizes the number of issued queries and reduces the delays due to the latency of query results. We reuse the results of occlusion queries from the last frame in order to initiate and schedule the queries in the next frame. This is done by processing nodes of a spatial hierarchy in a front-to-back order and interleaving occlusion queries with rendering of certain previously visible nodes. The proposed scheduling of the queries makes use of spatial and temporal coherence of visibility. Despite its simplicity, the algorithm achieves good culling efficiency for scenes of various types. The implementation of the algorithm is straightforward and it can be easily integrated in existing real-time rendering packages based on common hierarchical data structures.Categories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism
Description
@article{10.1111:j.1467-8659.2004.00793.x,
journal = {Computer Graphics Forum},
title = {{Coherent Hierarchical Culling: Hardware Occlusion Queries Made Useful}},
author = {Bittner, Jiri and Wimmer, Michael and Piringer, Harald and Purgathofer, Werner},
year = {2004},
publisher = {The Eurographics Association and Blackwell Publishing, Inc},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2004.00793.x}
}