Using the visibility complex for radiosity computation

  • Rachel Orti
  • Frédo Durand
  • Stéphane Rivière
  • Claude Puech
Submitted Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1148)


The radiosity method is particularly suitable for global illumination calculations in static environments. Nonetheless, for applications of image synthesis such as lighting design or architectural simulation, we have to deal with dynamic environments. To make the method usable in a real case, the illumination has to be updated as fast as possible after an object moves. The efficient way is to find the calculations strictly necessary to be recomputed after a change in the scene. The largest part of the computation time is spent on visibility calculation. In this paper, we investigate the possible speed ups in those calculations. We propose the use of the visibility complex for radiosity calculations. The presented study is realized for 2D scenes of convex objects in the static case. We show that the visibility complex is very suitable for radiosity calculations in this context, and that it also allows for efficient updates in the dynamic case.


radiosity discontinuity meshing form factor visibility complex dynamic environments 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Daniel R. Baum, John R. Wallace, Michael F. Cohen, and Donald P. Greenberg. The back-buffer algorithm: An extension of the radiosity method to dynamic environments. The Visual Computer, 2(5):298–306, September 1986.CrossRefGoogle Scholar
  2. 2.
    Shenchang Eric Chen. Incremental radiosity: An extension of progressive radiosity to an interactive image synthesis system. In Forest Baskett, editor, Computer Graphics (SIGGRAPH'90 Proceedings), volume 24, pages 135–144, August 1990.Google Scholar
  3. 3.
    F. Durand. Etude du complexe de visibilit. Rapport du DEA d'Informatique de Grenoble, France, June 1995.Google Scholar
  4. 4.
    F. Durand and C. Puech. The visibility complex made visibly simple. In Proc. 11th Annu. ACM Sympos. Comput. Geom., page V2, 1995.Google Scholar
  5. 5.
    David W. George, Francois X. Sillion, and Donald P. Greenberg. Radiosity redistribution for dynamic environments. IEEE Computer Graphics and Applications, 10(4):26–34, July 1990.CrossRefGoogle Scholar
  6. 6.
    C. Goral, K. E. Torrance, and D. P. Greenberg. Modeling the interaction of light between diffuse surfaces. In Computer Graphics (SIGGRAPH'84 Proceedings), 18:3, pages 213–222, July 1984.CrossRefGoogle Scholar
  7. 7.
    S. J. Gortler, P. Schroder, M. F. Cohen, and P. Hanrahan. Wavelet radiosity. In Computer Graphics (SIGGRAPH'93 Proceedings), pages 221–230, August 1993.Google Scholar
  8. 8.
    P. S. Heckbert. Simulating Global Illumination Using Adaptive Meshing. PhD thesis, UC Berkeley, June 1991.Google Scholar
  9. 9.
    P. S. Heckbert. Radiosity in flatland. In Computer Graphics forum (EURO-GRAPHICS'92 Proceedings), 11:3, pages 181–192, September 1992.CrossRefGoogle Scholar
  10. 10.
    N. Holzschuch, F. Sillion, and G. Drettakis. An efficient progressive refinement strategy for hierarchical radiosity. In Fifth Eurographics Workshop on Rendering, Darmstadt, Germany, pages 343–357, June 1994.Google Scholar
  11. 11.
    H. C. Hottel. Radiant heat transmission. In W. H. McAdams, editor, Heat Transmission, chapter 4. McGraw-Hill, New-York, 3rd edition, 1954.Google Scholar
  12. 12.
    M. Pocchiola and G. Vegter. Sweep algorithm for visibility graphs of curved obstacles. Manuscrit, Liens, Ecole Norm. Sup., Paris, June 1993.Google Scholar
  13. 13.
    M. Pocchiola and G. Vegter. The visibility complex. In Proc. 9th Annu. ACM Sympos. Comput. Geom., pages 328–337, 1993.Google Scholar
  14. 14.
    M. Pocchiola and G. Vegter. Computing the visibility graph via pseudotriangulation. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 248–257, 1995.Google Scholar
  15. 15.
    S. Rivière. Topologically sweeping the visibility complex of polygonal scenes. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages C36–C37, 1995.Google Scholar
  16. 16.
    S. Rivière. Dealing with degeneracies and numerical imprecisions when computing visibility graphs. 12th European Workshop on Computational Geometry CG'96, Muenster, Germany, 1996.Google Scholar
  17. 17.
    S. Rivire. Experimental comparison of two algorithms for computing visibility graphs. Manuscrit, 1993.Google Scholar
  18. 18.
    L. A. Santalo. Integral Geometry and Geometric Probability, volume 1 of Encyclopedia of Mathematics and its Applications. Addison-Wesley Publishing Company, 1976.Google Scholar
  19. 19.
    M. Sbert. An integral geometry based method for fast form-factor computation. In Computer Graphics forum (EUROGRAPHICS'93 Proceedings), 12:3, pages 409–420, September 1993.CrossRefGoogle Scholar
  20. 20.
    P. Schroeder, S. Gortler, M. Cohen, and Pat Hanrahan. Wavelet projections for radiosity. In Proc. 4th Eurographics Workshop on Rendering, Paris, France, pages 105–114, June 1993.Google Scholar
  21. 21.
    E. S. Shaw. Hierarchical radiosity for dynamic environments. Master's thesis, Cornell University, August 1994.Google Scholar
  22. 22.
    F. X. Sillion and C. Puech. Radiosity and Global Illumination. Morgan Kaufmann Publishers, Inc., 1994.Google Scholar
  23. 23.
    S. J. Teller. Visibility Computations in Densely Occluded Polyhedral Environments. PhD thesis, UC Berkeley, 1992.Google Scholar
  24. 24.
    S. J. Teller and P. M. Hanrahan. Global visibility algorithms for illumination computations. In Computer Graphics (SIGGRAPH'93 Proceedings), pages 239–246, August 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Rachel Orti
    • 1
  • Frédo Durand
    • 1
  • Stéphane Rivière
    • 1
  • Claude Puech
    • 1
  1. 1.IMAGIS/GRAVIR-IMAGGrenoble Cedex 09France

Personalised recommendations