Masked Depth Culling for Graphics Hardware

Magnus Andersson, Jon Hasselgren, Tomas Akenine-Möller

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

Abstract

Hierarchical depth culling is an important optimization, which is present in all modern high performance graphics processors. We present a novel culling algorithm based on a layered depth representation, with a per-sample mask indicating which layer each sample belongs to. Our algorithm is feed forward in nature in contrast to previous work, which rely on a delayed feedback loop. It is simple to implement and has fewer constraints than competing algorithms, which makes it easier to load-balance a hardware architecture. Compared to previous work our algorithm performs very well, and it will often reach over 90% of the efficiency of an optimal culling oracle. Furthermore, we can reduce bandwidth by up to 16% by compressing the hierarchical depth buffer.
Original languageEnglish
Title of host publicationProceedings of ACM SIGGRAPH Asia 2015
PublisherAssociation for Computing Machinery (ACM)
Volume34
DOIs
Publication statusPublished - 2015
EventSIGGRAPH Asia - Kobe, Japan
Duration: 2015 Nov 2 → …

Publication series

NameACM Transactions on Graphics (TOG)
Number6
Volume34
ISSN (Print)0730-0301

Conference

ConferenceSIGGRAPH Asia
Country/TerritoryJapan
CityKobe
Period2015/11/02 → …

Subject classification (UKÄ)

  • Computer and Information Sciences

Fingerprint

Dive into the research topics of 'Masked Depth Culling for Graphics Hardware'. Together they form a unique fingerprint.

Cite this