Masked Software Occlusion Culling

Jon Hasselgren
Intel

Magnus Andersson
Intel

Tomas Akenine-Möller
Intel

High Performance Graphics, 2016

Abstract

Efficient occlusion culling in dynamic scenes is a very important topic to the game and real-time graphics community in order to accelerate rendering. We present a novel algorithm inspired by recent advances in depth culling for graphics hardware, but adapted and optimized for SIMD-capable CPUs. Our algorithm has very low memory overhead and is 3× faster than previous work, while culling 98% of all triangles culled by a full resolution depth buffer approach. It supports interleaving occluder rasterization and occlusion queries without penalty, making it easy to use in scene graph traversal or rendering code.

Downloads

Paper
Author generated version
Code

Last update: Thursday, 10-Sep-2009 13:23:22 CEST
Page Manager: Jonas Wisbrant
Publisher: Department of Computer Science