Effective Compression Techniques for Precomputed Visibility

  • Michiel van de Panne
  • A. James Stewart
Part of the Eurographics book series (EUROGRAPH)


In rendering large models, it is important to identify the small subset of primitives that is visible from a given viewpoint One approach is to partition the viewpoint space into viewpoint cells, and then precompute a visibility table which explicitly records for each viewpoint cell whether or not each primitive is potentially visible. We propose two algorithms for compressing such visibility tables in order to produce compact and natural descriptions of potentially-visible sets. Alternatively, the algorithms can be thought of as techniques for clustering cells and clustering primitives according to visibility criteria The algorithms are tested on three types of scenes which have very different structures: a terrain model, a building model, and a world consisting of curved tunnels. The results show that the natural structure of each type of scene can automatically be exploited to achieve a compact representation of potentially visible sets.


Compression Algorithm Lossy Compression Lossless Compression Visible Polygon Item Buffer 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Frédéric Cazals, George Drettakis, and Claude Puech. Filtering, clustering and hierarchy construction: a new solution for ray-tracing complex scenes. Computer Graphics Forum, 14(3):371–382, August 1995. Proceedings of Eurographics’ 95. ISSN 1067-7055.CrossRefGoogle Scholar
  2. 2.
    D. Cohen-Or, G. Fibich, D. Halperin, and E. Zadicario. Conservative visibility and strong occlusion for viewspace partitioning of densely occluded scenes. 1998.Google Scholar
  3. 3.
    D. Cohen-Or and A. Snaked. Visibility and dead-zones in digital terrain maps. Computer Graphics Forum, 14(3):C/171–C/180, September 1995.Google Scholar
  4. 4.
    D. Cohen-Or and E. Zadicario. Visibility streaming for network-based walkthroughs. In Proceedings of Graphics Interface’ 98, 1998.Google Scholar
  5. 5.
    Satyan Coorg and Seth Teller. Temporally coherent conservative visibility. In Proceedings of the Twelfth Annual Symposium On Computational Geometry (ISG’ 96), pages 78–87, New York, May 1996. ACM Press.Google Scholar
  6. 6.
    Satyan Coorg and Seth Teller. Real-time occlusion culling for models with large occluders. In Proceedings of the 1997 Symposium on 3D Interactive Graphics, 1997.Google Scholar
  7. 7.
    Z. Gigus and J. Malik. Computing the aspect graph for the line drawings of polyhedral objects. IEEE Trans. Pattern Analysis and Machine Intelligence, 12(2), February 1990.Google Scholar
  8. 8.
    N. Greene. Hierarchical polygon tiling with coverage masks. Computer Graphics, 30(An-nual Conference Series):65–74, 1996.Google Scholar
  9. 9.
    N. Greene, M. Kass, and G. Miller. Hierarchical Z-buffer visibility. In Computer Graphics (SIGGRAPH’ 93 Proceedings), 1993.Google Scholar
  10. 10.
    Pat Hanrahan, David Salzman, and Larry Aupperle. A rapid hierarchical radiosity algorithm. Computer Graphics (SIGGRAPH’ 91 Proceedings), 25(4): 197–206, July 1991.CrossRefGoogle Scholar
  11. 11.
    Lichan Hong, Shigeru Muraki, Arie Kaufman, Dirk Bartz, and Taosong He. Virtual voyage: Interactive navigation in the human colon. In Turner Whitted, editor, SIGGRAPH 97 Conference Proceedings, Annual Conference Series, pages 27–34. ACM SIGGRAPH, Addison Wesley, August 1997.Google Scholar
  12. 12.
    Donald J. Meagher. Efficient synthetic image generation of arbitrary 3-D objects. In Proceedings of the IEEE Conference on Pattern Recognition and Image Processing, pages 473–478, June 1982.Google Scholar
  13. 13.
    H. Plantinga. Conservative visibility preprocessing for efficient walkthroughs of 3d scenes. In Proceedings of Graphics Interface’ 93, pages 166–173, 1993.Google Scholar
  14. 14.
    A. James Stewart. Fast horizon computation at all points of a terrain with visibility and shading applications. IEEE Transactions on Visualization and Computer Graphics, 4(1): 82–93, March 1998.CrossRefGoogle Scholar
  15. 15.
    Seth Teller and Pat Hanrahan. Global visibility algorithms for illumination computations. In Computer Graphics Proceedings, Annual Conference Series, 1993, pages 239–246, 1993.Google Scholar
  16. 16.
    Seth J. Teller. Computing the antipenumbra of an area light source. In Computer Graphics (SIGGRAPH’ 92 Proceedings), volume 26, pages 139–148, July 1992.CrossRefGoogle Scholar
  17. 17.
    Seth J. Teller and Carlo H. Séquin. Visibility preprocessing for interactive walkthroughs. In Thomas W. Sederberg, editor, Computer Graphics (SIGGRAPH’ 91 Proceedings), volume 25, pages 61–69, July 1991.Google Scholar
  18. 18.
    Y. Wang, H. Bao, and Q. Peng. Accelerated walkthroughs of virtual environments based on visibility preprocessing and simplification. Computer Graphics Forum (Eurographics 98 issue), 17(3):187–194, 1998.MATHCrossRefGoogle Scholar
  19. 19.
    R. Yagel and W. Ray. Visibility computation for efficient walkthrough of complex environments. Presence, 5(1):45–60, 1995.Google Scholar
  20. 20.
    H. Zhang, D. Manocha, T. Hudson, and Kenneth E. Hoff III. Visibility culling using hierarchical occlusion maps. In SIGGRAPH 97 Conference Proceedings.Google Scholar

Copyright information

© Springer-Verlag/Wien 1999

Authors and Affiliations

  • Michiel van de Panne
    • 1
  • A. James Stewart
    • 1
  1. 1.Department of Computer ScienceUniversity of TorontoCanada

Personalised recommendations