Information-Theory-Based Oracles for Hierarchical Radiosity

  • Jaume Rigau
  • Miquel Feixas
  • Mateu Sbert
Conference paper

DOI: 10.1007/3-540-44842-X_29

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2669)
Cite this paper as:
Rigau J., Feixas M., Sbert M. (2003) Information-Theory-Based Oracles for Hierarchical Radiosity. In: Kumar V., Gavrilova M.L., Tan C.J.K., L’Ecuyer P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2669. Springer, Berlin, Heidelberg

Abstract

In the radiosity method scene meshing has to accurately represent illumination variations avoiding unnecessary refinements that would increase the computational cost. In this paper we present three refinement criteria for hierarchical radiosity which are based on the information content of a ray between two patches or elements and the loss of information transfer between them due to the discretisation. The results obtained with our information-theory-based oracles improve on the classic ones based on transported power, kernel smoothness, and smoothness of received radiosity.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Jaume Rigau
    • 1
  • Miquel Feixas
    • 1
  • Mateu Sbert
    • 1
  1. 1.Institut d’Informàtica i AplicacionsUniversitat de GironaSpain

Personalised recommendations