Skip to main content
SpringerLink
Log in

On the Computational Complexity of Hierarchical Radiosity

  • Chapter
  • First Online:
Computer Science in Perspective

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2598))

  • 653 Accesses

Abstract

The hierarchical radiosity algorithm is an efficient approach to simulation of light with the goal of photo-realistic image rendering. Hanrahan et. al. describe the initialization and the refinement of links between the scene’s patches based upon a user-specified error parameter ε . They state that the number of links is linear in the number of elements if ε is assumed to be a constant. We present a result based upon the assumption that the geometry is constant and ε approaches 0 in a multigridding-procedure. Then the algorithm generates L=θ(N 2) links where N denotes the number of elements generated by the algorithm.

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. M. F. Cohen and J. R. Wallace. Radiosity and Realistic Image synthesis. Academic Press Professional, Cambridge, 1993.

    MATH  Google Scholar 

  2. R. Garmann. “Hierarchical radiosity-an analysis of computational complexity.” Research Report 584/1995, Fachbereich Informatik, Universität Dortmund, Germany, D-44221 Dort-mund, August 1995. Also available at http://ls7-www.informatik.uni-dortmund.de

    Google Scholar 

  3. P. Hanrahan, D. Salzman, and L. Aupperle. “A rapid hierarchical radiosity algorithm.” Computer Graphics, vol. 25, pp. 197–206, July 1991.

    Google Scholar 

  4. D. Lischinski, B. Smits, and D. P. Greenberg. “Bounds and error estimates for radiosity.” In Proceedings of SIGGRAPH 94, pp. 67–74, 1994.

    Google Scholar 

  5. P. Schröder. Wavelet Algorithms for Illumination Computations. PhD thesis, Princeton University, November 1994.

    Google Scholar 

  6. F. X. Sillion and C. Puech. Radiosity &Global Illumination. Morgan Kaufman, San Francisco, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik VII (Computer Graphics) University of Dortmund, D-44221, Dortmund, Germany

    Robert Garmann & Heinrich Müller

Authors
  1. Robert Garmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Heinrich Müller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Bonn, Informatik I, Römerstraße 164, 53117, Bonn, Germany

    Rolf Klein

  2. Praktische Informatik III, FernUniversität Hagen, Informatikzentrum Universitätsstraße 1, 58084, Hagen, Germany

    Hans-Werner Six

  3. Praktische Informatik - Datenbanken, Universität Kassel, 34109, Kassel, Germany

    Lutz Wegner

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Garmann, R., Müller, H. (2003). On the Computational Complexity of Hierarchical Radiosity. In: Klein, R., Six, HW., Wegner, L. (eds) Computer Science in Perspective. Lecture Notes in Computer Science, vol 2598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36477-3_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-36477-3_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00579-7

  • Online ISBN: 978-3-540-36477-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation