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 Citations (Scopus)

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

Fingerprint

Visibility
Sampling
Availability
Data storage equipment

Keywords

  • Occlusion culling
  • PVS
  • Visibility
  • Visibility sampling

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

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

Guided visibility sampling. / Wonka, Peter; Wimmer, Michael; Zhou, Kaichi; Maierhofer, Stefan; Hesina, Gerd; Reshetov, Alexander.

ACM Transactions on Graphics. Vol. 25 3. ed. 2006. p. 494-502.

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

Wonka, P, Wimmer, M, Zhou, K, Maierhofer, S, Hesina, G & Reshetov, A 2006, Guided visibility sampling. in ACM Transactions on Graphics. 3 edn, vol. 25, pp. 494-502, ACM SIGGRAPH 2006, Boston, MA, United States, 7/30/06. https://doi.org/10.1145/1141911.1141914
Wonka P, Wimmer M, Zhou K, Maierhofer S, Hesina G, Reshetov A. Guided visibility sampling. In ACM Transactions on Graphics. 3 ed. Vol. 25. 2006. p. 494-502 https://doi.org/10.1145/1141911.1141914
Wonka, Peter ; Wimmer, Michael ; Zhou, Kaichi ; Maierhofer, Stefan ; Hesina, Gerd ; Reshetov, Alexander. / Guided visibility sampling. ACM Transactions on Graphics. Vol. 25 3. ed. 2006. pp. 494-502
@inproceedings{16820fd882754c938bdf64e403d97e1c,
title = "Guided visibility sampling",
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.",
keywords = "Occlusion culling, PVS, Visibility, Visibility sampling",
author = "Peter Wonka and Michael Wimmer and Kaichi Zhou and Stefan Maierhofer and Gerd Hesina and Alexander Reshetov",
year = "2006",
month = "7",
doi = "10.1145/1141911.1141914",
language = "English (US)",
volume = "25",
pages = "494--502",
booktitle = "ACM Transactions on Graphics",
edition = "3",

}

TY - GEN

T1 - Guided visibility sampling

AU - Wonka, Peter

AU - Wimmer, Michael

AU - Zhou, Kaichi

AU - Maierhofer, Stefan

AU - Hesina, Gerd

AU - Reshetov, Alexander

PY - 2006/7

Y1 - 2006/7

N2 - 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.

AB - 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.

KW - Occlusion culling

KW - PVS

KW - Visibility

KW - Visibility sampling

UR - http://www.scopus.com/inward/record.url?scp=33749236973&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33749236973&partnerID=8YFLogxK

U2 - 10.1145/1141911.1141914

DO - 10.1145/1141911.1141914

M3 - Conference contribution

VL - 25

SP - 494

EP - 502

BT - ACM Transactions on Graphics

ER -