A Low Complexity Discrete Radiosity Method - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Computers and Graphics Année : 2006

A Low Complexity Discrete Radiosity Method

(1) , (1)
1

Résumé

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.
Fichier principal
Vignette du fichier
radiosity-computer-and-graphics.pdf (831.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01183722 , version 1 (10-08-2015)

Identifiants

  • HAL Id : hal-01183722 , version 1

Citer

Pierre Yves Chatelier, Rémy Malgouyres. A Low Complexity Discrete Radiosity Method. Computers and Graphics, 2006, Discrete Geometry for Computer Imagery, 30 (1), pp.37-45. ⟨hal-01183722⟩

Collections

PRES_CLERMONT
224 Consultations
303 Téléchargements

Partager

Gmail Facebook Twitter LinkedIn More