We present a novel Hierarchical depth culling algorithm. It is simple to implement and has fewer constraints than competing algorithms, making it easier to load-balance the hardware. Compared to previous work our algorithm performs very well, both in terms of bandwidth reduction and culling rate.

Magnus Andersson, Lund University, Intel Corporation
Jon Hasselgren, Intel Corporation
Tomas Akenine-Möller, Lund University, Intel Corporation