Virtual Occluders: An Efficient Intermediate PVS representation

  • Vladlen Koltun
  • Yiorgos Chrysanthou
  • Daniel Cohen-Or
Part of the Eurographics book series (EUROGRAPH)

Abstract

In this paper we introduce the notion of virtual occluders. Given a scene and a viewcell, a virtual occluder is a view-dependent (simple) convex object, which is guaranteed to be fully occluded from any given point within the viewcell and which serves as an effective occluder from the given viewcell. Virtual occluders are a compact intermediate representation of the aggregate occlusion for a given cell. The introduction of such view-dependent virtual occluders enables applying an effective region-to-region or cell-to-cell culling technique and efficiently computing a potential visibility set (PVS) from a region/cell. We present a technique that synthesizes such virtual occluders by aggregating the visibility of a set of individual occluders and we show the technique’s effectiveness.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Michael Abrash. Zen of Graphics Programming. Coriolis Group Books, second edition, 1996.Google Scholar
  2. 2.
    J. Airey, J. Rohlf, and F. Brooks. Towards image realism with interactive update rates in complex virtual building environments. ACM Siggraph Special Issue on 1990 Symposium on Interactive 3D Graphics, 24(2):41–50, 1990.Google Scholar
  3. 3.
    J. Bittner, V. Havran, and P. Slavik. Hierarchical visibility culling with occlusion trees. In Proceedings of Computer Graphics International’98, pages 207–219, June 1998.Google Scholar
  4. 4.
    A. T. Campbell, III and D. S. Fussell. An analytic approach to illumination with area light sources. Technical Report R-91–25, Dept. of Computer Sciences, Univ. of Texas at Austin, August 1991.Google Scholar
  5. 5.
    N. Chin and S. Feiner. Fast object-precision shadow generation for area light sources using BSP trees. In ACM Computer Graphics (Symp. on Interactive 3D Graphics), pages 21–30, 1992.Google Scholar
  6. 6.
    Y. Chrysanthou. Shadow Computation for 3D Interaction and Animation. PhD thesis, Queen Mary and Westfield College, University of London, February 1996.Google Scholar
  7. 7.
    Daniel Cohen-Or, Gadi Fibich, Dan Halperin, and Eyal Zadicario. Conservative visibility and strong occlusion for viewspace partitionin of densely occluded scenes. Computer Graphics Forum, 17(3):243–254, 1998. ISSN 1067–7055.CrossRefGoogle Scholar
  8. 8.
    Daniel Cohen-Or and Eyal Zadicario. Visibility streaming for network-based walkthroughs. Graphics Interface ‘98, pages 1–7, June 1998. ISBN 0-9695338-6-1.Google Scholar
  9. 9.
    Satyan Coorg and Seth Teller. Real-time occlusion culling for models with large occluders. 1997 Symposium on Interactive 3D Graphics, pages 83–90, April 1997. ISBN 0-89791-884-3.CrossRefGoogle Scholar
  10. 10.
    G. Drettakis and E. Fiume. A fast shadow algorithm for area light sources using backprojection. In Andrew Glassner, editor, ACM Computer Graphics, pages 223–230, July 1994.Google Scholar
  11. 11.
    Frédo Durand, George Drettakis, Joëlle Thollot, and Claude Puech. Conservative visibility preprocessing using extended projections. To appear in the proceedings of SIGGRAPH2000, 2000.Google Scholar
  12. 12.
    T.A. Funkhouser. Database management for interactive display of large architectural models. Graphics Interface, pages 1–8, May 1996.Google Scholar
  13. 13.
    Craig Gotsman, Oded Sudarsky, and Jeffry Fayman. Optimized occlusion culling. Computer & Graphics, 23(5):645–654, 1999.CrossRefGoogle Scholar
  14. 14.
    Ned Greene and M. Kass. Hierarchical Z-buffer visibility. In Computer Graphics Proceedings, Annual Conference Series, 1993, pages 231–240, 1993.Google Scholar
  15. 15.
    T. Hudson, D. Manocha, J. Cohen, M. Lin, K. Hoff, and H. Zhang. Accelerated occlusion culling using shadow frusta. In Proceedings of the 13th International Annual Symposium on Computational Geometry (SCG-97), pages 1–10, New York, June4–6 1997. ACM Press.Google Scholar
  16. 16.
    F.A. Law and T.S. Tan. Preprocessing occlusion for real-time selective refinement. In ACM Symposium on Interactive 3D Graphics, pages 47–53, April 1999.Google Scholar
  17. 17.
    Tomas Moller and Eric Haines. Real-Time Rendering. A. K. Peters Limited, 1999.Google Scholar
  18. 18.
    Carlos Saona-Vazquez, Isabel Navazo, and Pere Brunei. The visibility octree: A data structure tor 3d navigation. Computer & Graphics, 23(5):635–644, 1999CrossRefGoogle Scholar
  19. 19.
    Gernot Schaufler, Xavier Decoret, Julie Dorsey, and Francois Sillion. Conservative volumetric visibility with occluder fusion. To appear in the proceedings of SIGGRAPH2000, 2000.Google Scholar
  20. 20.
    Seth J. Teller and Carlo H. Sequin. Visibility preprocessing for interactive walkthroughs Computer Graphics (Proceedings of SIGGRAPH 91), 25(4):61–69, July 1991 ISBN 0-201-56291-X. Held in Las Vegas, Nevada.CrossRefGoogle Scholar
  21. 21.
    Michiel van de Panne and A. James Stewart. Effective compression techniques for precomputed visibility. In Eurographics Workshop on Rendering, pages 305–316 June 1999Google Scholar
  22. 22.
    Peter Wonka Michael Wimmer, and Dieter Schmalstieg. Visibility preprocessing with occluder fusion for urban walkthroughs. In proceeding of Eurographics Workshop on Rendering, June 2000.Google Scholar
  23. 23.
    H. Zhang, D. Manocha, T. Hudson, and K. Hoff. Visibility culling using hierarchy occlusion maps. In Computer Graphics (Proceedings of SIGGRAPH 97), pages 77–88, 1997.Google Scholar

Copyright information

© Springer-Verlag Wien 2000

Authors and Affiliations

  • Vladlen Koltun
    • 1
  • Yiorgos Chrysanthou
    • 2
  • Daniel Cohen-Or
    • 1
  1. 1.Tel Aviv UniversityIsrael
  2. 2.University College LondonUK

Personalised recommendations