Dynamic bounding volume hierarchies for occlusion culling

Abstract

We present an algorithm for rendering complex scenes using occlusion queries to resolve visibility. To organize objects in the scene, the algorithm uses a ternary tree which is dynamically modified according to the current view and positions of the objects in the scene. Aside from using heuristic techniques to estimate unnecessary queries, the algorithm uses several new features to estimate the set of visible objects more precisely while still retaining the conservativeness. The algorithm is suitable for both static and dynamic scenes with huge number of moving objects.