Skip to main content

Efficient Compression of Visibility Sets

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 3804))

Abstract

Interactive network-based walkthroughs in large urban environments raise difficult problems due to the size and density of these scenes. Thanks to the strong occlusion complexity of such environments, visibility streaming is a particularly efficient technique for minimizing the network load. In this paper, we present a solution which relies on client-side processing of visibility information so as to minimize the server workload. To solve the problem of transmitting the visibility data to the client, we suggest a bi-level compression scheme for the visibility sets that performs significantly better than previous methods. As a result, the visibility sets can be efficiently transmitted on-demand to the client and then used for adaptive streaming and rendering. Finally, we present our experimental results for a virtual city walkthrough.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aliaga, D., Manocha, D.: Interactive Walkthrough of Large Geometric Datasets (2000), http://www.cs.unc.edu/~geom/SIG00_COURSE

  2. Cohen-Or, D., Fibich, G., Halperin, D., Zadicario, E.: Conservative Visibility and Strong Occlusion for Viewspace Partitioning of Densely Occluded Scenes. Computer Graphics Forum 17, 243–254 (1998)

    Article  Google Scholar 

  3. Funkhouser, T.A.: Database Management for Interactive Display of Large Architectural Models. In: Proc. Graphics Interface 1996, pp. 1–8 (1996)

    Google Scholar 

  4. Cohen-Or, D., Chrysanthou, Y., Silva, C., Durand, F.: A Survey of Visibility for Walkthrough Applications. IEEE Transactions on Visualization and Computer Graphics, 412–431 (2003)

    Google Scholar 

  5. Gioia, P., Aubault, O., Bouville, C.: Real-Time Reconstruction of Wavelet Encoded Meshes for View-Dependent Transmission and Visualisation. IEEE Trans. on CSVT 14, 1009–1020 (2004)

    Google Scholar 

  6. Schmalstieg, D., Gervautz, M.: Demand-Driven Geometry Transmission for Distributed Virtual Environments. Computer Graphics Forum 15, 421–432 (1996)

    Article  Google Scholar 

  7. Pantazopoulos, I., Tzafestas, S.: Occlusion Culling Algorithms: A Comprehensive Survey. Journal of Intelligent and Robot Systems 35, 123–156 (2002)

    Article  MATH  Google Scholar 

  8. Cohen-Or, D., Zadicario, E.: Visibility Streaming for Network-based Walkthrough. In: Proc. Graphics Interface 1998, pp. 1–7 (1998)

    Google Scholar 

  9. Leyvand, T., Sorkine, O., Cohen-Or, D.: Ray Space Factorization for From-Region Visibility. ACM Transactions on Graphics (Proceedings of SIGGRAPH 2003) 22, 595–604 (2003)

    Google Scholar 

  10. Wonka, P., Wimmer, M., Schmalstieg, D.: Visibility Preprocessing with Occluder Fusion for Urban Walkthroughs. In: 11th Eurographics Workshop on Rendering, pp. 71–82 (2000)

    Google Scholar 

  11. Marvie, J.E., Bouatouch, K.: A Vrml97-X3D Extension for Massive Scenery Management in Virtual Worlds. In: Proceedings of the ninth international conference on 3D Web technology, pp. 145–153 (2004)

    Google Scholar 

  12. van de Panne, M., Stewart, A.: Effective Compression Techniques for Precomputed Visibility. In: 12th Eurographics Workshop on Rendering, pp. 305–316 (1999)

    Google Scholar 

  13. Gotsman, C., Sudarsky, O., Fayman, J.: Optimized Occlusion Culling Using Five-Dimensional Subdivision. Computer & Graphics 23(5), 645–654 (1999)

    Article  Google Scholar 

  14. Zach, C., Karner, K.: Progressive Compression of Visibility Data for View-dependent Multiresolution Meshes. In: WSCG 2003, vol. 11 (2003)

    Google Scholar 

  15. Nadler, B., Fibich, G., Lev-Yehudi, S., Cohen-Or, D.: A qualitative and quantitative visibility analysis in urban scenes. Computer & Graphics 23, 655–666 (1999)

    Article  Google Scholar 

  16. Koltun, V., Chrysanthou, Y., Cohen-Or, D.: Virtual Occluders: An efficient Intermediate PVS Representation. In: 11th Eurographics Workshop on Rendering, pp. 59–70 (2000)

    Google Scholar 

  17. Moreira, F., Comba, J., Freitas, C.: Smart Visible Sets for Networked Virtual Environments. In: SIBGRAPI, pp. 373–380 (2002)

    Google Scholar 

  18. Chhugani, J., Purnomo, B., Krishnan, S., Venkatasubramanian, S., Johnson, D., Kumar, S.: vLOD: High-Fidelity Walkthrough of Large Virtual Environments. IEEE Transactions on Visualization and Computer Graphics 11 (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bouville, C., Marchal, I., Bouget, L. (2005). Efficient Compression of Visibility Sets. In: Bebis, G., Boyle, R., Koracin, D., Parvin, B. (eds) Advances in Visual Computing. ISVC 2005. Lecture Notes in Computer Science, vol 3804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11595755_30

Download citation

  • DOI: https://doi.org/10.1007/11595755_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30750-1

  • Online ISBN: 978-3-540-32284-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics