Instant Visibility
| dc.contributor.author | Wonka, Peter | en_US |
| dc.contributor.author | Wimmer, Michael | en_US |
| dc.contributor.author | Sillion, Francois X. | en_US |
| dc.date.accessioned | 2015-02-16T11:06:10Z | |
| dc.date.available | 2015-02-16T11:06:10Z | |
| dc.date.issued | 2001 | en_US |
| dc.description.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. | en_US |
| dc.description.number | 3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 20 | en_US |
| dc.identifier.doi | 10.1111/1467-8659.00534 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 411-421 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/1467-8659.00534 | en_US |
| dc.publisher | Blackwell Publishers Ltd and the Eurographics Association | en_US |
| dc.title | Instant Visibility | en_US |