Guided visibility sampling

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

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

14 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 SIGGRAPH 2006 Papers, SIGGRAPH '06
Pages494-502
Number of pages9
DOIs
StatePublished - Dec 1 2006
EventACM SIGGRAPH 2006 Papers, SIGGRAPH '06 - Boston, MA, United States
Duration: Jul 30 2006Aug 3 2006

Publication series

NameACM SIGGRAPH 2006 Papers, SIGGRAPH '06

Other

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

    Fingerprint

Keywords

  • PVS
  • occlusion culling
  • visibility
  • visibility sampling

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Wonka, P., Wimmer, M., Zhou, K., Maierhofer, S., Hesina, G., & Reshetov, A. (2006). Guided visibility sampling. In ACM SIGGRAPH 2006 Papers, SIGGRAPH '06 (pp. 494-502). (ACM SIGGRAPH 2006 Papers, SIGGRAPH '06). https://doi.org/10.1145/1179352.1141914