A Low Complexity Discrete Radiosity Method

Article English OPEN
Chatelier , Pierre Yves ; Malgouyres , Rémy (2006)
  • Publisher: Elsevier
  • Subject: [INFO.INFO-GR] Computer Science [cs]/Graphics [cs.GR] | linear complexity | visibility | [INFO.INFO-TI] Computer Science [cs]/Image Processing | [ INFO.INFO-TI ] Computer Science [cs]/Image Processing | [ INFO.INFO-GR ] Computer Science [cs]/Graphics [cs.GR] | voxels | discrete geometry | Radiosity
    acm: ComputingMethodologies_COMPUTERGRAPHICS

International audience; Rather than using Monte Carlo sampling techniques or patch projections to compute radiosity, it is possible to use a discretization of a scene into voxels and perform some discrete geometry calculus to quickly compute visibility information. In such a framework , the radiosity method may be as precise as a patch-based radiosity using hemicube computation for form-factors, but it lowers the overall theoretical complexity to an O(N log N) + O(N), where the O(N) is largely dominant in practice. Hence, the apparent complexity is linear for time and space, with respect to the number of voxels in the scene. This method does not require the storage of pre-computed form factors, since they are computed on the fly in an efficient way. The algorithm which is described does not use 3D discrete line traversal and is not similar to simple ray-tracing. In the present form, the voxel-based radiosity equation assumes the ideal diffuse case and uses solid angles similarly to the hemicube.
  • References (12)
    12 references, page 1 of 2

    [1] John Amanatides and Andrew Woo. A fast voxel traversal algorithm for ray tracing. In Eurographics '87, pages 3-10. Elsevier Science Publishers, Amsterdam, North-Holland, 1987.

    [2] Eric Andres and Marie-Andr´ee Jacob. The discrete analytical hyperspheres. IEEE Transactions on Visualization and Computer Graphics, 3(1):75-86, 1997.

    [3] Pierre Y. Chatelier and R´emy Malgouyres. A low complexity discrete radiosity method. In Eric Andres, Guillaume Damiand, and Pascal Lienhardt, editors, DGCI, volume 3429 of Lecture Notes in Computer Science, pages 392-403. Springer, 2005.

    [4] Michael F. Cohen and Donald P. Greenberg. The hemi-cube: a radiosity solution for complex environments. In SIGGRAPH '85: Proceedings of the 12th annual conference on Computer graphics and interactive techniques, pages 31-40. ACM Press, 1985.

    [5] Isabelle Debled-Rennesson. E´tude et reconnaissance des droites et plans discrets. PhD thesis, Universit´e Louis Pasteur, Strasbourg, 1995.

    [6] Philip Dutre, Kavita Bala, and Philippe Bekaert. Advanced Global Illumination. A. K. Peters, Ltd., Natick, MA, USA, 2002.

    [7] Paul S. Heckbert. Finite Element Methods for Radiosity. In ACM SIGGRAPH '93 Course Notes - Global Illumination, pages 1-7. 1993.

    [8] R´emy Malgouyres. A discrete radiosity method. In Achille Braquelaire, JacquesOlivier Lachaud, and Anne Vialard, editors, Discrete Geometry for Computer Imagery, 10th International Conference, DGCI 2002, Bordeaux, France, pages 428-438. Springer, April 2002.

    [9] Jean-Pierre Reveill`es. G´eometrie discr`ete, calcul en nombres entiers et algorithmique. PhD thesis, Universit´e Louis Pasteur, Strasbourg, 1991.

    [10] Nilo Stolte and Ren´e Caubet. Discrete ray-tracing of huge voxel spaces. Comput. Graph. Forum, 14(3):383-394, 1995.

  • Metrics
    No metrics available
Share - Bookmark