Distributed Ray Tracing

Distributed ray tracing, also called distribution ray tracing and stochastic ray tracing, is a refinement of ray tracing that allows for the rendering of "soft" phenomena. Conventional ray tracing uses single rays to sample many different domains. For example, when the color of an object is calculated, ray tracing might send a single ray to each light source in the scene. This leads to sharp shadows, since there is no way for a light source to be partially occluded (another way of saying this that all lights are point sources and have zero area). Conventional ray tracing also typically spawns one reflection ray and one transmission ray per intersection. As a result, reflected and transmitted images are perfectly (and unrealistically) sharp. Distributed ray tracing removes these restrictions by averaging multiple rays distributed over an interval. For example, soft shadows can be rendered by distributing shadow rays over the light source area. Blurry reflections and transmissions can be rendered by distributing reflection and transmission rays over a solid angle about the "true" reflection or transmission direction. Adding "soft" phenomena to ray-traced images in this way can improve realism immensely, since the sharp phenomena rendered by conventional ray tracing are almost never seen in reality. More advanced effects are also possible using the same framework. For instance, depth of field can be achieved by distributing ray origins over the lens area. In an animated scene, motion blur can be simulated by distributing rays in time. Distributing rays in the spectrum allows for the rendering of dispersion effects, such as rainbows and prisms. Mathematically, in order to evaluate the rendering equation, one must evaluate several integrals. Conventional ray tracing estimates these integrals by sampling the value of the integrand at a single point in the domain, which is clearly a very bad approximation. Distributed ray tracing samples the integrand at many randomly chosen points and averages the results to obtain a better approximation. It is essentially an application of the Monte Carlo method to 3D computer graphics, and for this reason is also called stochastic ray tracing. It is important that the samples used in distributed ray tracing be randomly distributed. If they are evenly distributed, then very ugly aliasing is the result. As a result, importance sampling and the Metropolis algorithm are important in distributed ray tracing. The term distributed ray tracing also sometimes refers to the application of distributed computing techniques to ray tracing, but because of ambiguity this is more properly called parallel ray tracing (in reference to parallel computing).

See also

 

<< PreviousWord BrowserNext >>
maharaja agrasen college
asiaphilia
yevgeny vakhtangov
phantasmagoria (album)
luiza erundina
sami vnsk
mate bulic
john adams kuakini
four sticks
bienal de so paulo
dominican war of independence
jody conradt
paul gray (musician)
charles cooper
piaggio p.108
yahoo! personals
rhizostomae
national unity (czech republic)
tarzan cooper
jeff tremaine
way upstream
louis archambault
henry sy
saint grimbald
buldeo
morogoro
sahebganj
dave cowens
test management approach
vacuum field equations
johann friedrich pfaff
tadeusz kondrusiewicz
largest known prime
johann pfaff
controversy (album)
omiya station, saitama
xavier le pichon
batman (album)
list of porto metro stations
alternate character
the very best of prince
brandon chillar
comalco
diamonds and pearls