A Light Hierarchy for Fast Rendering of Scenes with Many Lights - Archive ouverte HAL Access content directly
Conference Papers Year : 1998

A Light Hierarchy for Fast Rendering of Scenes with Many Lights

, , (1)
1

Abstract

We introduce a new data structure in the form of a light hierarchy for efficiently ray-tracing scenes with many light sources. An octree is constructed with the point light sources in a scene. Each node represents all the light sources it contains by means of a virtual light source. We determine bounds on the error committed with this approximation to shade a point, both for the cases of diffuse and specular reflections. These bounds are then used to guide a hierarchical shading algorithm. If the current level of the light hierarchy provides shading of sufficient quality, the approximation is used, thus avoiding the cost of shading for all the light sources contained below this level. Otherwise the descent into the light hierarchy continues. Our approach has been implemented for scenes without occlusion. The results show important acceleration compared to standard ray-tracing (up to 90 times faster) and an important improvement compared to Ward's adaptive shadow testing.
Not file

Dates and versions

inria-00510080 , version 1 (17-08-2010)

Identifiers

  • HAL Id : inria-00510080 , version 1

Cite

Eric Paquette, Pierre Poulin, George Drettakis. A Light Hierarchy for Fast Rendering of Scenes with Many Lights. Computer Graphics Forum (Eurographics '98 Conference Proceedings), Eurographics, 1998, Lisbonne, Portugal. pp.63--74. ⟨inria-00510080⟩
88 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More