Depth-complexity based occluder selection

  • Authors:
  • Gerhard Kurka

  • Affiliations:
  • Johannes Kepler University, Linz

  • Venue:
  • ACM SIGGRAPH 2002 conference abstracts and applications
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Densely occluded regions containing many stacked objects along the line of view generally show a high local depth-complexity (DC). With respect to occlusion culling such regions require dense occluder-sets, in order to provide gap free occlusion. Using pure size or distance based selection heuristics fail to consider such regions. This sketch presents a novel dynamic occluder selection approach, which selects occluders that cover regions of high DC. Depth-Complexity Based Occluder Selection [Kurka 2001] is based on the evaluation of a low resolution (128x128 pixel) raw scene depiction (RSD), which is rendered once per frame by a simple but fast image-based rendering (IBR) technique.