Fast Rendering of Complex Dynamic Scenes
Abstract
We present a novel algorithm capable of rendering complex dynamic scenes at high frame rates. The key part of the algorithm is occlusion culling which is performed by an optimized usage of the hardware occlusion queries. The spatial organization of the scene using 2-level BSP-like hierarchy helps to speed up evaluating full and partial occlusion of the objects. The algorithm handles both static and dynamic objects and places no restrictions on the shape of objects.
BibTeX
@inproceedings {10.2312:LocalChapterEvents:TPCG:TPCG06:081-087,
booktitle = {Theory and Practice of Computer Graphics 2006},
editor = {Louise M. Lever and Mary McDerby},
title = {{Fast Rendering of Complex Dynamic Scenes}},
author = {Kovalcík, Vit and Sochor, Jiri},
year = {2006},
publisher = {The Eurographics Association},
ISBN = {3-905673-59-2},
DOI = {10.2312/LocalChapterEvents/TPCG/TPCG06/081-087}
}
booktitle = {Theory and Practice of Computer Graphics 2006},
editor = {Louise M. Lever and Mary McDerby},
title = {{Fast Rendering of Complex Dynamic Scenes}},
author = {Kovalcík, Vit and Sochor, Jiri},
year = {2006},
publisher = {The Eurographics Association},
ISBN = {3-905673-59-2},
DOI = {10.2312/LocalChapterEvents/TPCG/TPCG06/081-087}
}