Advertisement

Reducing Memory Requirements for Interactive Radiosity Using Movement Prediction

  • Frank Schöffel
  • Andreas Pomi
Part of the Eurographics book series (EUROGRAPH)

Abstract

The line-space hierarchy is a very powerful approach for the efficient update of radiosity solutions according to geometry changes. However, it suffers from its enormous memory consumption when storing shafts for the entire scene. We propose a method for reducing the memory requirements of the line-space hierarchy by the dynamic management of shaft storage. We store shaft information only locally for those parts of the scene that are currently affected by the geometry change. When the dynamic object enters new regions, new shaft data has to be computed, but on the other hand we can get rid of outdated data ‘behind’ the dynamic object. Simple movement prediction schemes are applied, so that we can provide shaft data to the radiosity update process in time when needed. We show how storage management and pre-calculation of shafts can be efficiently performed in parallel to the radiosity update process itself.

Keywords

Movement Prediction Dynamic Object Global Illumination Future Position Garbage Collector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baum, D., Wallace, J., Cohen, M., Greenberg, D.: The back-buffer algorithm: an extension of the radiosity method to dynamic environments. The Visual Computer, 2(5):298–306, 1986.CrossRefGoogle Scholar
  2. 2.
    Chen, S.: Incremental radiosity: An extension of progressive refinement radiosity to an interactive image synthesis system. Computer Graphics (Proc. SIGGRAPH’ 90), 24(4): 135–144, August 1990.CrossRefGoogle Scholar
  3. 3.
    Chim, J., Lau R., Si, A., Leong, H., To, D., Green, M., Lam, M.: Multi-resolution model transmission in Distributed Virtual Environments. Proceedings of the ACM Symposium on Virtual Reality Software and Technology (VRST’ 98), pages 25–33, November 1998.Google Scholar
  4. 4.
    Cohen, M., Chen, S., Wallace, J., Greenberg, D.: A progressive refinement approach to fast radiosity image generation. Computer Graphics (Proc. SIGGRAPH’ 88), 22(4):75–84, August 1988.CrossRefGoogle Scholar
  5. 5.
    Drettakis, G., Sillion, F.: Interactive update of global illumination using a line-space hierarchy. Computer Graphics (Proc. SIGGRAPH’ 97), 31(3):57–64, August 1997.Google Scholar
  6. 6.
    Forsyth, D., Yang, C., Teo, K.: Efficient radiosity in dynamic environments. In Sakas, G. et al. (eds.): Photorealistic Rendering Techniques, pages 313–323, Springer-Verlag, 1995. Proc. 5th Eurographics Workshop on Rendering (Darmstadt, 1994).Google Scholar
  7. 7.
    George, D., Sillion, F., Greenberg, D.: Radiosity redistribution for dynamic environments. IEEE Computer Graphics and Applications, 10(4):26–34, July 1990.CrossRefGoogle Scholar
  8. 8.
    Goral, C., Torrance, K., Greenberg, D., Battaile, B.: Modeling the interaction of light between diffuse surfaces. Computer Graphics (Proc. SIGGRAPH’ 84), 18(3):213–222, July 1984.CrossRefGoogle Scholar
  9. 9.
    Haines, E., Wallace, J.: Shaft culling for efficient ray-traced radiosity. Proc. 2nd Eurographics Workshop on Rendering (Barcelona, 1991). Proc. 2nd Eurographics Workshop on Rendering (Barcelona, 1991).Google Scholar
  10. 10.
    Hanrahan, P., Saltzman, D., Aupperle, L.: A rapid hierarchical radiosity algorithm. Computer Graphics (Proc. SIGGRAPH’ 91), 25(4): 197–206, August 1991.CrossRefGoogle Scholar
  11. 11.
    Holzschuch, N., Sillion, F., Drettakis, G.: An efficient progressive refinement strategy for hierarchical radiosity. In Sakas, G. et al. (eds.): Photorealistic Rendering Techniques, pages 357–372, Springer-Verlag, 1995. Proc. 5th Eurographics Workshop on Rendering (Darmstadt, 1994).Google Scholar
  12. 12.
    Kalman, R.: A new approach to linear filtering and prediction problems. J. Basic Eng., Series 82D, pages 35–45, 1960.Google Scholar
  13. 13.
    Müller, S., Schöffel, F.: Fast radiosity repropagation for interactive virtual environments using a shadow-form-factor-list. In Sakas, G. et al. (eds.): Photorealistic Rendering Techniques, pages 339–356, Springer-Verlag, 1995. Proc. 5th Eurographics Workshop on Rendering (Darmstadt, 1994).Google Scholar
  14. 14.
    Shaw, E.: Hierarchical radiosity for dynamic environments. Computer Graphics Forum, 16(2) 107–118, 1997.CrossRefGoogle Scholar
  15. 15.
    Sillion, F.: A unified hierarchical algorithm for global illumination with scattering volumes and object clusters. IEEE Trans. on Vis. and Comp. Graphics, 1(3):240–254, Sep. 1995.CrossRefGoogle Scholar
  16. 16.
    Smits, B., Arvo, J., Salesin, D.: An importance-driven radiosity algorithm. Computer Graphics (Proc. SIGGRAPH’ 92), 26(4):273–282, July 1992.CrossRefGoogle Scholar
  17. 17.
    Smits, B., Arvo, J., Greenberg, D.: A clustering algorithm for radiosity in complex environments. Computer Graphics (Proc. SIGGRAPH’ 94), 28(2):435–442, July 1994.Google Scholar
  18. 18.
    Stamminger, M., Schirmacher, H., Slusallek, Ph., Seidel, H.-P.: Getting rid of links in hierarchical radiosity. In Ferreira, N., Göbel, M. (eds.): Computer Graphics Forum (Proc. Eurographics’ 98), 17(3):C165–C174, 1998.Google Scholar

Copyright information

© Springer-Verlag/Wien 1999

Authors and Affiliations

  • Frank Schöffel
    • 1
  • Andreas Pomi
    • 2
  1. 1.Fraunhofer Institute for Computer GraphicsDarmstadtGermany
  2. 2.vrcom GmbHDarmstadtGermany

Personalised recommendations