Frédo Durand
George Drettakis
ABSTRACT
Visualization of very complex scenes can be significantly accelerated using occlusion culling. In this paper we present a visibility preprocessing method which efficiently computes potentially visible geometry for volumetric viewing cells. We introduce novel extended projection operators, which permits efficient and conservative occlusion culling with respect to all viewpoints within a cell, and takes into account the combined occlusion effect of multiple occluders. We use extended projection of occluders onto a set of projection planes to create extended occlusion maps; we show how to efficiently test occludees against these occlusion maps to determine occlusion with respect to the entire cell. We also present an improved projection operator for certain specific but important configurations. An important advantage of our approach is that we can re-project extended projections onto a series of projection planes (via an occlusion sweep), and accumulate occlusion information from multiple blockers. This new approach allows the creation of effective occlusion maps for previously hard-to-treat scenes such as leaves of trees in a forest. Graphics hardware is used to accelerate both the extended projection and reprojection operations. We present a complete implementation demonstrating significant speedup with respect to view-frustum culling only, without the computational overhead of on-line occlusion culling.
- ACW+99.D. Aliaga, J. Cohen, A. Wilson, Eric Baker, H. Zhang, C. Erikson, K. Hoff, T. Hudson, W. Smerzlinger, R. Bastos, M. Whitton, F. Brooks, and D. Manocha. MMR: An interactive massive model rendering system using geometric and image-based acceleration. In ACM Syrup. on Interactive 3D Graphics, 1999. Google Scholar
Digital Library
- ARB90.J. Airey, J. Rohlf, and F. Brooks, Jr. Towards image realism with interactive update rates in complex virtual building environments. In ACM Syrup. on Interactive 3D Graphics, 1990. Google ScholarDigital Library
- CG85.M. Cohen and D. Greenberg. The hemicube: A radiosity solution for complex environments. In Computer Graphics (Proc. Siggraph), 1985. Google ScholarDigital Library
- CH97.D.A. Carlson and J. K. Hodgins. Simulation levels of detail for realtime animation. In Graphics Interface, 1997. Google ScholarDigital Library
- Cla76.J.H. Clark. Hierarchical geometric models for visible surface algorithms. Communications of the ACM, October 1976. Google ScholarDigital Library
- COFHZ98.D. Cohen-Or, G. Fibich, D. Halperin, and E. Zadicario. Conservative visibility and strong occlusion for visibility partitionning of densely occluded scenes. In Eurographics, 1998.Google Scholar
- COZ98.D. Cohen-Or and E. Zadicario. Visibility streaming for network-based walkthroughs. In Graphics Interface, 1998.Google Scholar
- CT96.S. Coorg and S. Teller. Temporally coherent conservative visibility. In ACM Symp. On Computational Geometry, 1996. Google ScholarDigital Library
- CT97.S. Coorg and S. Teller. Real-time occlusion culling for models with large occluders. In ACM Symp. on Interactive 3D Graphics, 1997. Google ScholarDigital Library
- Dur99.Fr6do Durand. 3D Visibility, analysis and applications. PhD thesis, U. Joseph Fourier, Grenoble, 1999. http://www-imagis.imag, fr.Google Scholar
- FS93.T. Funkhouser and C. S6quin. Adaptive display algorithm for interactive frame rates during visualization of complex virtual environments. In Computer Graphics (Proc. Siggraph), 1993. Google ScholarDigital Library
- Fun95.T. Funkhouser. RING - A client-server system for multi-user virtual environments. ACM Symp. on Interactive 3D Graphics, 1995. Google ScholarDigital Library
- Fun96.T. Funkhouser. Database management for interactive display of large architectural models. In Graphics Interface, 1996. Google ScholarDigital Library
- GKM93.N. Greene, M. Kass, and G. Miller. Hierarchical Z-buffer visibility. In Computer Graphics, (Proc. Siggraph), 1993. Google ScholarDigital Library
- HMC+97.T. Hudson, D. Manocha, J. Cohen, M. Lin, K. Hoff, and H. Zhang. Accelerated occlusion culling using shadow frusta. InACMSymp. on Computational Geometry, 1997. Google ScholarDigital Library
- Jon71.C.B. Jones. A new approach to the 'hidden line' problem. The Computer Journal, 14(3):232-237, August 1971.Google ScholarCross Ref
- LG95.D. Luebke and C. Georges. Portals and mirrors: Simple, fast evaluation of potentially visible sets. In ACM Symp. on Interactive 3D Graphics, 1995. Google ScholarDigital Library
- LT99.F. Law and T. Tan. Preprocessing occlusion for real-time selective refinement. In ACM Symp. on Interactive 3D Graphics, 1999. Google ScholarDigital Library
- Max91.Max. Unified sun and sky illumination for shadows under trees. Comp. Vision, Graphics, and Image Processing. Graphical Models and Image Processing, 53(3):223-230, May 1991. Google ScholarDigital Library
- PD90.H. Plantinga and C. R. Dyer. Visibility, occlusion, and the aspect graph. Int. J. of Computer Vision, 5(2), 1990. Google ScholarDigital Library
- RH94.J. Rohlf and J. Helman. IRIS performer: A high performance multiprocessing toolkit for real-Time 3D graphics. In Computer Graphics (Proc. Siggraph), 1994. Google ScholarDigital Library
- SC96.O. Sudarsky and C.Gotsman. Output-sensitive visibility algorithms for dynamic scenes with applications to virtual reality. In Proc. Eurographics Conf., 1996.Google Scholar
- SDDS00.G. Schaufler, J. Dorsey, X. Decoret, and F. Sillion. Conservative volumetric visibility with occluder fusion. In Computer Graphics (Proc. Siggraph), 2000. Google ScholarDigital Library
- SLSD96.J. Shade, D. Lischinski, D. Salesin, and T. DeRose. Hierarchical image caching for accelerated walkthroughs of complex environments. In Computer Graphics (Proc. Siggraph), 1996. Google ScholarDigital Library
- SS98.C. Soler and F. Sillion. Fast calculation of soft shadow textures using convolution. In Computer Graphics, (Proc. Siggraph), 1998. Google ScholarDigital Library
- Ste97.A. James Stewart. Hierarchical visibility in terrains. Eurographics Workshop on Rendering 1997, June 1997. Google ScholarDigital Library
- Tel92.S.J. Teller. Visibility Computations in Densely Occluded Polyhedral Environments. PhD thesis, UC Berkeley, 1992. Google ScholarDigital Library
- TH93.S. Teller and P. Hanrahan. Global visibility algorithms for illumination computations. In Computer Graphics (Proc. Siggraph), 1993. Google ScholarDigital Library
- TS91.S. Teller and C. S6quin. Visibility preprocessing for interactive walkthroughs. In Computer Graphics (Proc. Siggraph), 1991. Google ScholarDigital Library
- vdPS99.M. van de Panne and J. Stewart. Effective compression techniques for precomputed visibility. In Eurographics Workshop on Rendering, 1999. Google ScholarDigital Library
- WBP98.Y. Wang, H. Bao, and Q. Peng. Accelerated walkthroughs of virtual environments based on visibility processing and simplification. In Proc. Eurographics Conf., 1998.Google Scholar
- WS99.P. Wonka and D. Schmalstieg. Occluder shadows for fast walkthroughs of urban environments. In Proc. Eurographics Conf., 1999.Google ScholarCross Ref
- ZMHH97.H. Zhang, D. Manocha, T. Hudson, and K. E. Hoff III. Visibility culling using hierarchical occlusion maps. In Computer Graphics (proc. Siggraph), 1997. Google ScholarDigital Library
Index Terms
- Conservative visibility preprocessing using extended projections
Recommendations
Ray space factorization for from-region visibility
From-region visibility culling is considered harder than from-point visibility culling, since it is inherently four-dimensional. We present a conservative occlusion culling method based on factorizing the 4D visibility problem into horizontal and ...
Ray space factorization for from-region visibility
SIGGRAPH '03: ACM SIGGRAPH 2003 PapersFrom-region visibility culling is considered harder than from-point visibility culling, since it is inherently four-dimensional. We present a conservative occlusion culling method based on factorizing the 4D visibility problem into horizontal and ...
A general algorithm for output-sensitive visibility preprocessing
I3D '05: Proceedings of the 2005 symposium on Interactive 3D graphics and gamesOcclusion culling based on precomputed visibility information is a standard method for accelerating the rendering in real-time graphics applications. In this paper we present a new general algorithm that performs the visibility precomputation for a ...
Comments