Radiosity (computer graphics)

Uses your system voice; voice and rate in settings.

Snapshot

≈ 8 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

) 79th iteration , rendered with and without radiosity by BMRT In 3D computer graphics, radiosity is an application of the finite element method to solving the rendering equation for scenes with surfaces that reflect light diffusely. Unlike rendering methods that use Monte Carlo algorithms (such as path tracing), which handle all types of light paths, typical radiosity only account for paths (represented by the code "LD*E") which leave a light source and are reflected diffusely some number of times (possibly zero) before hitting the eye.

Radiosity is a global illumination algorithm in the sense that the illumination arriving on a surface comes not just directly from the light sources, but also from other surfaces reflecting light. Radiosity is viewpoint independent, which increases the calculations involved, but makes them useful for all viewpoints. Radiosity methods were first developed in about 1950 in the engineering field of heat transfer.

They were later refined specifically for the problem of rendering computer graphics in 1984 1985 by researchers at Cornell University and Hiroshima University. Notable commercial radiosity engines are Enlighten by Geomerics (used for games including Battlefield 3 and Need for Speed: The Run); 3ds Max; form•Z; LightWave 3D and the Electric Image Animation System.

) 79th iteration , rendered with and without radiosity by BMRT In 3D computer graphics, radiosity is an application of the finite element method to solving the rendering equation for scenes with surfaces that reflect light diffusely. Unlike rendering methods that use Monte Carlo algorithms (such as path tracing), which handle all types of light paths, typical radiosity only account for paths (represented by the code "LD*E") which leave a light source and are reflected diffusely some number of times (possibly zero) before hitting the eye.

Radiosity is a global illumination algorithm in the sense that the illumination arriving on a surface comes not just directly from the light sources, but also from other surfaces reflecting light. Radiosity is viewpoint independent, which increases the calculations involved, but makes them useful for all viewpoints. Radiosity methods were first developed in about 1950 in the engineering field of heat transfer.

They were later refined specifically for the problem of rendering computer graphics in 1984 1985 by researchers at Cornell University and Hiroshima University. Notable commercial radiosity engines are Enlighten by Geomerics (used for games including Battlefield 3 and Need for Speed: The Run); 3ds Max; form•Z; LightWave 3D and the Electric Image Animation System.

B(x)\, dA = E(x) \, dA +\rho(x) \, dA \int_{S}B(x') \frac{1}{\pi r^2} \cos\theta_x\cos\theta_{x'} \cdot \mathrm{Vis}(x,x') \,\mathrm dA' where: B(x) i dA i is the total energy leaving a small area dA i around a point x. E(x) i dA i is the emitted energy. ρ(x) is the reflectivity of the point, giving reflected energy per unit area by multiplying by the incident energy per unit area (the total energy which arrives from other patches).

S denotes that the integration variable x' runs over all the surfaces in the scene r is the distance between x and x' θ x and θ x' are the angles between the line joining x and x' and vectors normal to the surface at x and x' respectively. Vis(x,x' ) is a visibility function, defined to be 1 if the two points x and x' are visible from each other, and 0 if they are not.

If the surfaces are approximated by a finite number of planar patches, each of which is taken to have a constant radiosity B i and reflectivity ρ i , the above equation gives the discrete radiosity equation, B_i = E_i + \rho_i \sum_{j=1}^n F_{ij} B_j where F ij is the geometrical view factor for the radiation leaving j and hitting patch i. This equation can then be applied to each patch. The equation is monochromatic, so color radiosity rendering requires calculation for each of the required colors.

B = (I - \rho F)^{-1} E \; This gives the full "infinite bounce" solution for B directly. However the number of calculations to compute the matrix solution scales according to n 3 , where n is the number of patches. This becomes prohibitive for realistically large values of n. Instead, the equation can more readily be solved iteratively, by repeatedly applying the single-bounce update formula above. Formally, this is a solution of the matrix equation by Jacobi iteration.

Because the reflectivities ρ i are less than 1, this scheme converges quickly, typically requiring only a handful of iterations to produce a reasonable solution. Other standard iterative methods for matrix equation solutions can also be used, for example the Gauss–Seidel method, where updated values for each patch are used in the calculation as soon as they are computed, rather than all being updated synchronously at the end of each sweep.

The solution can also be tweaked to iterate over each of the sending elements in turn in its main outermost loop for each update, rather than each of the receiving patches. This is known as the shooting variant of the algorithm, as opposed to the gathering variant.

Using the view factor reciprocity, A i F ij = A j F ji , the update equation can also be re-written in terms of the view factor F ji seen by each sending patch A j : A_i B_i = A_i E_i + \rho_i \sum_{j=1}^n A_j B_j F_{ji} This is sometimes known as the "power" formulation, since it is now the total transmitted power of each element that is being updated, rather than its radiosity. The view factor F ij itself can be calculated in a number of ways.

Early methods used a hemicube (an imaginary cube centered upon the first surface to which the second surface was projected, devised by Michael F. Cohen and Donald P. Greenberg in 1985). The surface of the hemicube was divided into pixel-like squares, for each of which a view factor can be readily calculated analytically. The full form factor could then be approximated by adding up the contribution from each of the pixel-like squares.

The projection onto the hemicube, which could be adapted from standard methods for determining the visibility of polygons, also solved the problem of intervening patches partially obscuring those behind. However all this was quite computationally expensive, because ideally form factors must be derived for every possible pair of patches, leading to a quadratic increase in computation as the number of patches increased.

This can be reduced somewhat by using a binary space partitioning tree to reduce the amount of time spent determining which patches are completely hidden from others in complex scenes; but even so, the time spent to determine the form factor still typically scales as n log n. New methods include adaptive integration.

See also

Cornell box Photon mapping Ray tracing Path tracing

References

Further reading

Radiosity Overview, from HyperGraph of SIGGRAPH (provides full matrix radiosity algorithm and progressive radiosity algorithm) Radiosity, by Hugo Elias (also provides a general overview of lighting algorithms, along with programming examples) Radiosity, by Allen Martin (a slightly more mathematical explanation of radiosity) ROVER, by Dr. Tralvex Yeap (Radiosity Abstracts & Bibliography Library) Radiosity: Basic Implementations (Basic radiosity survey)

External links

RADical, by Parag Chaudhuri (an implementation of shooting & sorting variant of progressive radiosity algorithm with OpenGL acceleration, extending from GLUTRAD by Colbeck) Radiosity Renderer and Visualizer (simple implementation of radiosity renderer based on OpenGL) (Licensed software code that provides realtime radiosity for computer game applications. Developed by the UK company Geomerics)

Text derived from https://en.wikipedia.org/w/index.php?oldid=1352537129 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

5 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.