An Optimal Occlusion Culling Algorithm for Complex 3D Scenes

This paper proposes an algorithm for hierarchical occlusion culling using hardware occlusion queries.The algorithm can reduce the idle time of the CPU and GPU due to the latency of occlusion queries by interleaving occlusion queries with rendering of visible objects.Furthermore,in order to minimize the number of unnecessary occlusion queries,we formulate the occlusion queries problem as an optimal decisionmaking and the overall performance is optimized by performing only occlusion queries for objects that are likely to be hidden.The experimental results show that the algorithm can significantly increase rendering speed for arbitrary complex scenes.