Instant visibility

P. Wonka, M. Wimmer, F. X. Sillion

Research output: Contribution to journalArticle

32 Scopus citations

Abstract

We present an online occlusion culling system which computes visibility in parallel to the rendering pipeline. We show how to use point visibility algorithms to quickly calculate a tight potentially visible set (PVS) which is valid for several frames, by shrinking the occluders used in visibility calculations by an adequate amount. These visibility calculations can be performed on a visibility server, possibly a distinct computer communicating with the display host over a local network. The resulting system essentially combines the advantages of online visibility processing and region-based visibility calculations, allowing asynchronous processing of visibility and display operations. We analyze two different types of hardware-based point visibility algorithms and address the problem of bounded calculation time which is the basis for true real-time behavior. Our results show reliable, sustained 60 Hz performance in a walkthrough with an urban environment of nearly 2 million polygons, and a terrain flyover.

Original languageEnglish (US)
Pages (from-to)411-421
Number of pages11
JournalComputer Graphics Forum
Volume20
Issue number3
DOIs
StatePublished - Sep 3 2001

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design

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

  • Cite this

    Wonka, P., Wimmer, M., & Sillion, F. X. (2001). Instant visibility. Computer Graphics Forum, 20(3), 411-421. https://doi.org/10.1111/1467-8659.00534