Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs

  • Peter Wonka
  • Michael Wimmer
  • Dieter Schmalstieg
Part of the Eurographics book series (EUROGRAPH)


This paper presents an algorithm for occlusion culling from regions of space. It is conservative and able to find all significant occlusion. It discretizes the scene into view cells, for which cell-to-object visibility is precomputed, making on-line overhead negligible. Unlike other precomputation methods for view cells, it is able to conservatively compute all forms of occluder interaction for an arbitrary number of occluders. We describe an application of this algorithm to urban environments. A walkthrough system running an 8 million polygon model of the city of Vienna on consumer-level hardware illustrates our results.

Visibility determination occlusion culling occluder fusion urban walkthroughs 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    J. Bittner, V. Havran, P. Slavík. Hierarchical Visibility Culling with Occlusion Trees. Computer Graphics International 1998 Proceedings, pp. 207–219, 1998.Google Scholar
  2. [2]
    D. Cohen-Or, G. Fibich, D. Haperin, E. Zadicario. Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes. Computer Graphics Forum (Proceedings of EUROGRAPHICS’98), 17(3), pp. 243–253, 1998.CrossRefGoogle Scholar
  3. [3]
    S. Coorg, S. Teller. Real-Time Occlusion Culling for Models with Large Occluders. Proceedings of the Symposium on Interactive 3D Graphics, pp. 83–90, 1997.Google Scholar
  4. [4]
    F. Durand. 3D Visibility. Analytical Study and Applications. PhD thesis, IMAGISGRAVIR/IMAG-INRIA, Grenoble, France, 1999.Google Scholar
  5. [5]
    F. Durand, G. Drettakis, C. Puech. The Visibility Skeleton: A Powerful and Efficient Multi-Purpose Global Visibility Tool. SIGGRAPH 97 Conference Proceedings, pp. 89–100, 1997.Google Scholar
  6. [6]
    F. Durand, G. Drettakis, J. Thollot, C. Puech. Conservative Visibility Preprocessing using Extended Projections. To appear in SIGGRAPH 2000 Conference Proceedings.Google Scholar
  7. [7]
    Z. Gigus, J. Canny, R. Seidel. Efficiently computing and representing aspect graphs of polyhedral objects. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(6), pp. 542–551, 1991.CrossRefGoogle Scholar
  8. [8]
    N. Greene, M. Kass. Hierarchical Z-Buffer Visibility, SIGGRAPH 93 Conference Proceedings, pp. 231–240, 1993.Google Scholar
  9. [9]
    P. Heckbert, M. Garland. Survey of Polygonal Surface Simplification Algorithms. Multiresolution Surface Modeling (Course 25), SIGGRAPH, 1997.Google Scholar
  10. [10]
    T. Hudson, D. Manocha, J. Cohen, M. Lin, K. Hoff, H. Zhang. Accelerated Occlusion Culling using Shadow Frusta. 13th International Annual Symposium on Computational Geometry (SCG-97), pp. 1–10, 1997.Google Scholar
  11. [11]
    W. Jepson, R. Liggett, S. Friedman. An Environment for Real-time Urban Simulation. Proceedings of the Symposium on Interactive 3D Graphics, pp. 165–166, 1995.Google Scholar
  12. [12]
    V. Koltun, Y. Chrysanthou, D. Cohen-Or. Virtual Occluders: An Efficient Intermediate PVS Representation. To appear in Eurographics Rendering Workshop 2000.Google Scholar
  13. [13]
    A. Laurentini. The visual hull concept for silhouette-based image understanding. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(2), pp. 150–162, 1994.CrossRefGoogle Scholar
  14. [14]
    H. Plantinga, C. R. Dyer. Visibility, Occlusion, and the Aspect Graph, IJCV(5), No. 2, pp. 137–160, 1990.CrossRefGoogle Scholar
  15. [15]
    J. Rohlf, J. Helman. IRIS Performer: A High Performance Multiprocessing Toolkit for Real-Time 3D Graphics. SIGGRAPH 94 Conference Proceedings, pp. 381–395, 1994.Google Scholar
  16. [16]
    G. Schaufler, X. Decoret, J. Dorsey, F. Sillion. Conservative Volumetric Visibility with Occluder Fusion. To appear in SIGGRAPH 2000 Conference Proceedings.Google Scholar
  17. [17]
    G. Schaufler, W. Stürzlinger. A Three-Dimensional Image Cache for Virtual Reality. Computer Graphics Forum (Proceedings of EUROGRAPHICS’96), 15(3), pp. 227–235, 1996.CrossRefGoogle Scholar
  18. [18]
    J. Shade, D. Lischinski, D. Salesin, T. DeRose, J. Snyder. Hierarchical Image Caching for Accelerated Walkthroughs of Complex Environments. SIGGRAPH 96 Conference Proceedings, pp. 75–82, 1996.Google Scholar
  19. [19]
    F. Sillion, G. Drettakis, B. Bodelet. Efficient Impostor Manipulation for Real-Time Visualization of Urban Scenery. Computer Graphics Forum (Proceedings of EUROGRAPHICS’97), 16(3), pp. 207–218, 1997.CrossRefGoogle Scholar
  20. [20]
    A. Stewart. Hierarchical Visibility in Terrains. Eurographics Rendering Workshop 1997, pp. 217–228, 1997.Google Scholar
  21. [21]
    S. Teller. Computing the antipenumbra of an area light source. Computer Graphics (SIGGRAPH 92 Conference Proceedings), vol. 26, pp. 139–148, 1992.CrossRefGoogle Scholar
  22. [22]
    S. Teller, C. Sequin. Visibility preprocessing for interactive walkthroughs. Computer Graphics (SIGGRAPH 91 Conference Proceedings), vol. 25, pp. 61–69, 1991.CrossRefGoogle Scholar
  23. [23]
    P. Wonka, D. Schmalstieg. Occluder Shadows for Fast Walkthroughs of Urban Environments. Computer Graphics Forum (Proceedings of EUROGRAPHICS’99), pp. 51–60, 1999.Google Scholar
  24. [24]
    P. Wonka, M. Wimmer, D. Schmalstieg. Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs. Technical Report TR-186–2–00–06, Vienna University of Technology, 2000.Google Scholar
  25. [25]
    H. Zhang, D. Manocha, T. Hudson, K. E. Hoff. Visibility Culling Using Hierarchical Occlusion Maps. SIGGRAPH 97 Conference Proceedings, pp. 77–88, 1997.Google Scholar

Copyright information

© Springer-Verlag Wien 2000

Authors and Affiliations

  • Peter Wonka
    • 1
  • Michael Wimmer
    • 1
  • Dieter Schmalstieg
    • 1
  1. 1.Vienna University of TechnologyAustria

Personalised recommendations