Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Simulating Global Illumination Using Adaptive Meshing

Paul S. Heckbert

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-91-636
June 1991

http://www.eecs.berkeley.edu/Pubs/TechRpts/1991/CSD-91-636.pdf

One of the goals of computer graphics is the simulation of global illumination, the interreflection of light between diffuse and specular surfaces in three-dimensional scenes. Like thermal radiation, as studied in mechanical engineering and physics, global illumination is governed by an integral equation. A distinguishing feature of the integral equations of global illumination is that their solutions have numerous discontinuities, such as shadow edges, caused by occlusion. We show that the most common global illumination algorithms, radiosity and ray tracing, are simple finite element and Monte Carlo methods for solving integral equations, respectively. In the process of re-deriving these techniques, a number of alternative algorithms with higher accuracy are suggested. The principal alternatives explored in this thesis are adaptive meshing techniques that resolve discontinuities.

Radiosity algorithms can be made more accurate by a priori discontinuity meshing, placing mesh boundaries on significant discontinuities. Discontinuities are found using an object-space visible surface algorithm from the point of view of object vertices. The accuracy of radiosity simulations can also be improved using linear, quadratic, or higher degree elements instead of constant elements. Algorithms are developed first for two-dimensional radiosity in flatland problems, then extended to three dimensions.

Scenes containing diffuse and specular surfaces are most easily simulated using Monte Carlo ray tracing techniques. Traditional ray tracing algorithms trace rays from the eye into the scene. A bidirectional ray tracing algorithm is demonstrated that traces rays from both the lights and the eye, storing the diffuse intensity function in a radiosity texture on each diffuse surface in the scene. These textures are adaptively subdivided in order to resolve shadow edges and other discontinuities.

Advisor: Brian A. Barsky


BibTeX citation:

@phdthesis{Heckbert:CSD-91-636,
    Author = {Heckbert, Paul S.},
    Title = {Simulating Global Illumination Using Adaptive Meshing},
    School = {EECS Department, University of California, Berkeley},
    Year = {1991},
    Month = {Jun},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1991/5531.html},
    Number = {UCB/CSD-91-636},
    Abstract = {One of the goals of computer graphics is the simulation of global illumination, the interreflection of light between diffuse and specular surfaces in three-dimensional scenes. Like thermal radiation, as studied in mechanical engineering and physics, global illumination is governed by an integral equation. A distinguishing feature of the integral equations of global illumination is that their solutions have numerous discontinuities, such as shadow edges, caused by occlusion. We show that the most common global illumination algorithms, radiosity and ray tracing, are simple finite element and Monte Carlo methods for solving integral equations, respectively. In the process of re-deriving these techniques, a number of alternative algorithms with higher accuracy are suggested. The principal alternatives explored in this thesis are adaptive meshing techniques that resolve discontinuities. <p>Radiosity algorithms can be made more accurate by a priori discontinuity meshing, placing mesh boundaries on significant discontinuities. Discontinuities are found using an object-space visible surface algorithm from the point of view of object vertices. The accuracy of radiosity simulations can also be improved using linear, quadratic, or higher degree elements instead of constant elements. Algorithms are developed first for two-dimensional radiosity in flatland problems, then extended to three dimensions. <p>Scenes containing diffuse and specular surfaces are most easily simulated using Monte Carlo ray tracing techniques. Traditional ray tracing algorithms trace rays from the eye into the scene. A bidirectional ray tracing algorithm is demonstrated that traces rays from both the lights and the eye, storing the diffuse intensity function in a radiosity texture on each diffuse surface in the scene. These textures are adaptively subdivided in order to resolve shadow edges and other discontinuities.}
}

EndNote citation:

%0 Thesis
%A Heckbert, Paul S.
%T Simulating Global Illumination Using Adaptive Meshing
%I EECS Department, University of California, Berkeley
%D 1991
%@ UCB/CSD-91-636
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1991/5531.html
%F Heckbert:CSD-91-636