Guided visibility sampling

Peter Wonka, Michael Wimmer, Kaichi Zhou, Stefan Maierhofer, Gerd Hesina, Alexander Reshetov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations

Abstract

This paper addresses the problem of computing the triangles visible from a region in space. The proposed aggressive visibility solution is based on stochastic ray shooting and can take any triangular model as input. We do not rely on connectivity information, volumetric occluders, or the availability of large occluders, and can therefore process any given input scene. The proposed algorithm is practically memoryless, thereby alleviating the large memory consumption problems prevalent in several previous algorithms. The strategy of our algorithm is to use ray mutations in ray space to cast rays that are likely to sample new triangles. Our algorithm improves the sampling efficiency of previous work by over two orders of magnitude.

Original languageEnglish (US)
Title of host publicationACM Transactions on Graphics
Pages494-502
Number of pages9
Volume25
Edition3
DOIs
StatePublished - Jul 2006
EventACM SIGGRAPH 2006 - Boston, MA, United States
Duration: Jul 30 2006Aug 3 2006

Other

OtherACM SIGGRAPH 2006
CountryUnited States
CityBoston, MA
Period7/30/068/3/06

Keywords

  • Occlusion culling
  • PVS
  • Visibility
  • Visibility sampling

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Fingerprint Dive into the research topics of 'Guided visibility sampling'. Together they form a unique fingerprint.

  • Cite this

    Wonka, P., Wimmer, M., Zhou, K., Maierhofer, S., Hesina, G., & Reshetov, A. (2006). Guided visibility sampling. In ACM Transactions on Graphics (3 ed., Vol. 25, pp. 494-502) https://doi.org/10.1145/1141911.1141914