Instant visibility

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

Research output: Contribution to journalArticle

31 Citations (Scopus)

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)
JournalComputer Graphics Forum
Volume20
Issue number3
StatePublished - Sep 3 2001
Externally publishedYes

Fingerprint

Visibility
Display devices
Processing
Servers
Pipelines
Hardware

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

Wonka, P., Wimmer, M., & Sillion, F. X. (2001). Instant visibility. Computer Graphics Forum, 20(3).

Instant visibility. / Wonka, P.; Wimmer, M.; Sillion, F. X.

In: Computer Graphics Forum, Vol. 20, No. 3, 03.09.2001.

Research output: Contribution to journalArticle

Wonka, P, Wimmer, M & Sillion, FX 2001, 'Instant visibility', Computer Graphics Forum, vol. 20, no. 3.
Wonka P, Wimmer M, Sillion FX. Instant visibility. Computer Graphics Forum. 2001 Sep 3;20(3).
Wonka, P. ; Wimmer, M. ; Sillion, F. X. / Instant visibility. In: Computer Graphics Forum. 2001 ; Vol. 20, No. 3.
@article{b527290bfb3a437b9f07a07209356412,
title = "Instant visibility",
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.",
author = "P. Wonka and M. Wimmer and Sillion, {F. X.}",
year = "2001",
month = "9",
day = "3",
language = "English (US)",
volume = "20",
journal = "Computer Graphics Forum",
issn = "0167-7055",
publisher = "Wiley-Blackwell",
number = "3",

}

TY - JOUR

T1 - Instant visibility

AU - Wonka, P.

AU - Wimmer, M.

AU - Sillion, F. X.

PY - 2001/9/3

Y1 - 2001/9/3

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

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

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

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

M3 - Article

AN - SCOPUS:0035801025

VL - 20

JO - Computer Graphics Forum

JF - Computer Graphics Forum

SN - 0167-7055

IS - 3

ER -