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.
Type de document :
Communication dans un congrès
Eurographics, 2001, Manchester, United Kingdom. A. Chalmers and T.-M. Rhyne, 2001
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger
Contributeur : Team Evasion <>
Soumis le : mardi 17 août 2010 - 15:09:07
Dernière modification le : jeudi 11 janvier 2018 - 06:20:04
Document(s) archivé(s) le : jeudi 18 novembre 2010 - 03:00:02



  • HAL Id : inria-00510048, version 1




Peter Wonka, Michael Wimmer, François X. Sillion. Instant Visibility. Eurographics, 2001, Manchester, United Kingdom. A. Chalmers and T.-M. Rhyne, 2001. 〈inria-00510048〉



Consultations de la notice


Téléchargements de fichiers