Instant Visibility

Peter Wonka Michael Wimmer François X. Sillion 1
1 iMAGIS - Models, Algorithms and Geometry for Computer Generated Image Graphics
GRAVIR - IMAG - Graphisme, Vision et Robotique, Inria Grenoble - Rhône-Alpes
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download


https://hal.inria.fr/inria-00510048
Contributor : Team Evasion <>
Submitted on : Tuesday, August 17, 2010 - 3:09:07 PM
Last modification on : Thursday, January 11, 2018 - 6:20:04 AM
Long-term archiving on : Thursday, November 18, 2010 - 3:00:02 AM

Files

Identifiers

  • HAL Id : inria-00510048, version 1

Collections

INRIA | UGA | IMAG

Citation

Peter Wonka, Michael Wimmer, François X. Sillion. Instant Visibility. Eurographics, Eurographics, 2001, Manchester, United Kingdom. ⟨inria-00510048⟩

Share

Metrics

Record views

198

Files downloads

445