A Low Complexity Discrete Radiosity Method
Radiosity in 3D scenes is usually computed using a discretization of the surfaces into patches. A discretization into voxels is possible, coupled with the use of discrete geometry. An algorithm for radiosity solving with voxels is introduced, lowering the theoretical complexity to an O(N log N) + O(N), where the O(N) is largely dominant in practice, so that the apparent complexity is linear for time and space, with respect to the number of voxels in the scene. The method also fits in RAM and does not need disk storage. Instead of 3D discrete line traversal, a new algorithm is described to perform visibility computation. The voxel-based radiosity equation assumes the ideal diffuse case and uses solid angles similarly to the hemicube.
KeywordsRadiosity voxels discrete geometry linear complexity visibility ideal diffuse case
- 1.Amanatides, J., Woo, A.: A fast voxel traversal algorithm for ray tracing. In: Eurographics 1987, pp. 3–10. Elsevier Science Publishers, Amsterdam (1987)Google Scholar
- 3.Isabelle Debled-Rennesson. Étude et reconnaissance des droites et plans discrets. PhD thesis, Université Louis Pasteur, Strasbourg (1995)Google Scholar
- 4.Sillion, F.X., Puech, C.: Radiosity & Global Illumination. Morgan Kaufmann, San Francisco (1994)Google Scholar
- 6.Reveillès, J.-P.: Géometrie discrète, calcul en nombres entiers et algorithmique. PhD thesis, Université Louis Pasteur, Strasbourg (1991)Google Scholar
- 7.Sramek, M., Kaufman, A.: Vxt: a c++ class library for object voxelization. Volume Graphics, 119–134 (2000)Google Scholar