Occlusion Culling with Statistically Optimized Occlusion Queries

Warning

This publication doesn't include Institute of Computer Science. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

KOVALČÍK Vít SOCHOR Jiří

Year of publication 2005
Type Article in Proceedings
Conference WSCG 2005 short papers proceedings
MU Faculty or unit

Faculty of Informatics

Citation
Field Informatics
Keywords visibility; real-time rendering; occlusion culling; occlusion query
Description This paper presents an effective algorithm for occlusion culling using hardware occlusion queries. The number of queries is optimized according to the results of the queries from several preceeding frames. Parts of the scene which are found to be unoccluded in the recent frames, are tested less often thus reducing the number of queries performed per frame. The algorithm is applicable to any kind of scene, including scenes with moving objects. The algorithm utilizes a tree structure containing objects in the scene.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info