Skip to main content
SpringerLink
Log in

Guaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity

  • Conference paper
  • First Online:
Rendering Techniques 2000 (EGSR 2000)

Part of the book series: Eurographics ((EUROGRAPH))

Included in the following conference series:

Abstract

Visibility determination is the most expensive task in cluster hierarchical radiosity. Guaranteed full occlusion and full visibility can reduce these computations without causing visibility errors. We build a hierarchy of large convex occluders using face clustering. This structure is efficiently exploited to avoid computing visibility between mutually fully occluded scene elements. Used in conjunction with a full visibility culling method, we show improvements on several scenes.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Andújar, C. Saona-Vázquez, and I. Navazo. LOD visibility culling and occluder synthesis. Computer Aided Design, 2000. Accepted for publication.

    Google Scholar 

  2. P.H. Christensen, D. Lischinski, E.J. Stollnitz, and D.H. Salesin. Clustering for glossy global illumination. ACM Transactions on Graphics, 16(1):3–33, January 1997.

    Article  Google Scholar 

  3. D. Cohen-Or, G. Fibich, D. Halperin, and E. Zadicario. Conservative visibility and strong occlusion for viewspace partitioning of densely occluded scenes. Computer Graphics Forum (Eurographics ‘98), 17(3):243–254, 1998.

    Article  Google Scholar 

  4. S. Coorg and S. Teller. Real-time occlusion culling for models with large occluders. In 1997 Symposium on Interactive 3D Graphics, pages 83–90, April 1997.

    Chapter  Google Scholar 

  5. G. Drettakis and E. Fiume. A fast shadow algorithm for area light sources using backprojection. In Proceedings of SIGGRAPH ‘94, Annual Conference Series, pages 223–230, July 1994.

    Chapter  Google Scholar 

  6. R. Dumont and K. Bouatouch. Using levels of detail to speedup radiosity computation. Technical Report RR-3602, INRIA, 1999.

    Google Scholar 

  7. F. Durand. 3D visibility, analysis and applications. Ph.D. thesis, Université Joseph Fourier, Grenoble, 1999.

    Google Scholar 

  8. F. Durand, G. Drettakis, and C. Puech. Fast and accurate hierarchical radiosity using global visibility. ACM Transactions on Graphics, 18(2): 128–170, April 1999.

    Article  Google Scholar 

  9. F. Durand, G. Drettakis, and C. Puech. The visibility skeleton: A powerful and efficient multi-purpose global visibility tool. Proceedings of SIGGRAPH97, pages 89–100, August 1997.

    Article  Google Scholar 

  10. F. Durand, G. Drettakis, J. Thollot, and C. Puech. Conservative visibility preprocessing using extended projections. In SIGGRAPH 2000 Conference Proceedings, Annual Conference Series, July 2000, to appear.

    Google Scholar 

  11. M. Garland. Quadric-Based Polygonal Surface Simplification. Ph.D. thesis, Carnegie Mellon University, 1999.

    Google Scholar 

  12. S. Gibson and R.J. Hubbold. Efficient hierarchical refinement and clustering for radiosity in complex environments. Computer Graphics Forum, 15(5):297–310, 1996.

    Article  Google Scholar 

  13. E. Haines and J. Wallace. Shaft culling for efficient ray-traced radiosity. In Eurographics Workshop on Rendering, 1991.

    Google Scholar 

  14. P. Hanrahan, D. Salzman, and L. Aupperle. A rapid hierarchical radiosity algorithm. In Computer Graphics (SIGGRAPH ‘91 Proceedings), volume 25, pages 197–206, July 1991.

    Google Scholar 

  15. T. Hudson, D. Manocha, J. Cohen, M. Lin, K. Hoff, and H. Zhang. Accelerated occlusion culling using shadow frustra. In Proceedings of the Thirteenth Annual Symposium on Computational Geometry, pages 1–10, June 1997.

    Google Scholar 

  16. F.-A. Law and T.-S. Tan. Preprocessing occlusion for real-time selective refinement. In 1999 Symposium on Interactive 3D Graphics, pages 47–52, 1999.

    Google Scholar 

  17. D. Meneveaux. Lighting simulation in complex architectural environments: sequential and parallel approaches. Ph.D. thesis, Université de Rennes I, 1998.

    Google Scholar 

  18. G. Mueller, S. Schaefer, and D. Fellner. Automatic creation of object hierarchies for radiosity clustering. In Pacific Graphics ‘99, October 1999.

    Google Scholar 

  19. H. Plantinga. Conservative visibility preprocessing for efficient walkthroughs of 3D scenes. In Proceedings of Graphics Interface ‘93, pages 166–173, May 1993.

    Google Scholar 

  20. H. Plantinga and CR. Dyer. Visibility, occlusion, and the aspect graph. International Journal of Computer Vision, 5(2): 137–160, 1990.

    Article  Google Scholar 

  21. G. Schaufler, J. Dorsey, X. Decoret, and F.X. Sillion. Conservative volumetric visibility with occluder fusion. In SIGGRAPH 2000 Conference Proceedings, Annual Conference Series, July 2000, to appear.

    Google Scholar 

  22. F. Sillion. Clustering and volume scattering for hierarchical radiosity calculations. In Fifth Eurographics Workshop on Rendering, pages 105–117, June 1994.

    Google Scholar 

  23. F. Sillion, G. Drettakis, and C. Soler. A clustering algorithm for radiance calculation in general environments. In Eurographics Rendering Workshop1995, pages 196–205, June 1995.

    Google Scholar 

  24. F.X. Sillion. A unified hierarchical algorithm for global illumination with scattering volumes and object clusters. IEEE Transactions on Visualization and Computer Graphics, 1(3):240–254, September 1995.

    Article  Google Scholar 

  25. B. Smits. Efficiency issues for ray tracing. Journal of Graphics Tools, 3(2): 1–14, 1998.

    Article  MathSciNet  Google Scholar 

  26. B. Smits, J. Arvo, and D. Greenberg. A clustering algorithm for radiosity in complex environments. In Proceedings of SIGGRAPH ‘94, Annual Conference Series, pages 435–442, July 1994.

    Chapter  Google Scholar 

  27. C. Soler and F.X. Sillion. Fast calculation of soft shadow textures using convolution. In SIGGRAPH 98 Conference Proceedings, Annual Conference Series, pages 321–332, July 1998.

    Chapter  Google Scholar 

  28. M. Stamminger, H. Schirmacher, P. Slusallek, and H.-P Seidel. Getting rid of links in hierarchical radiosity. Computer Graphics Forum (Eurographics ‘98), 17(3): 165–174, 1998.

    Article  Google Scholar 

  29. A.J. Stewart and S. Ghali. Fast computation of shadow boundaries using spatial coherence and backprojections. In Proceedings of SIGGRAPH ‘94, Annual Conference Series, pages 231–238, July 1994.

    Chapter  Google Scholar 

  30. S. Teller and P. Hanrahan. Global visibility algorithms for illumination computations. In Proceedings of SIGGRAPH ‘93, Annual Conference Series, pages 239–246, 1993.

    Chapter  Google Scholar 

  31. S.J. Teller and C.H. Séquin. Visibility preprocessing for interactive walkthroughs. In Computer Graphics (SIGGRAPH ‘91 Proceedings), volume 25, pages 61–69, July 1991.

    Google Scholar 

  32. J.R. Wallace, K.A. Elmquist, and E.A. Haines. A ray tracing algorithm for progressive radiosity. In Computer Graphics (SIGGRAPH ‘89 Proceedings), volume 23, pages 315–324, July 1989.

    Google Scholar 

  33. Y. Wang, H. Bao, and Q. Peng. Accelerated walkthroughs of virtual environments based on visibility processing and simplification. Computer Graphics Forum (Eurographics ‘98), 17(3): 187–194, 1998.

    Article  Google Scholar 

  34. A. Willmott, P. Heckbert, and M. Garland. Face cluster radiosity. In Eurographics Workshop on Rendering, pages 293–304, June 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d’informatique et de recherche opérationnelle, Université de Montréal, Canada

    Luc Leblanc & Pierre Poulin

Authors
  1. Luc Leblanc
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Poulin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ecole Nationale Superieure des Mines de Saint Etienne, Saint Etienne, France

    Bernard Péroche PhD

  2. IBM TJ Watson Research Center, Hawthorne, NY, USA

    Holly Rushmeier PhD

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Wien

About this paper

Cite this paper

Leblanc, L., Poulin, P. (2000). Guaranteed Occlusion and Visibility in Cluster Hierarchical Radiosity. In: Péroche, B., Rushmeier, H. (eds) Rendering Techniques 2000. EGSR 2000. Eurographics. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6303-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-6303-0_9

  • Published:

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-83535-7

  • Online ISBN: 978-3-7091-6303-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation