A fast shadow algorithm for area light sources using backprojection

The fast identification of shadow regions due to area light sources is necessary for realistic rendering and for discontinuity meshing for global illumination. A new shadow-determination algorithm is presented that uses a data structure, called a backprojection, to represent the visible portion of a light source from any point in the scene. A complete discontinuity meshing algorithm is described for polyhedral scenes and area light sources, which includes an important class of light/geometry interactions that have not been implemented before. A fast incremental algorithm for computing backprojections is also described. The use of spatial subdivision, and heuristics based on computed statistics of typical scenes, results in efficient mesh and backprojection computation. Results of the implementation show that the use of the backprojection and discontinuity meshing permits accelerated high-quality rendering of shadows using both ray-casting and polygon-rendering with interpolants.

[1]  Jitendra Malik,et al.  Computing the Aspect Graph for Line Drawings of Polyhedral Objects , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Pierre Poulin,et al.  Shading and shadowing with linear light sources , 1990, Comput. Graph..

[3]  Raimund Seidel,et al.  Efficiently Computing and Representing Aspect Graphs of Polyhedral Objects , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  A. T. Campbell,et al.  An Analytic Approach to Illumination with Area Light Sources , 1991 .

[5]  E. Fiume,et al.  Structured sampling and reconstruction of illumination for image synthesis , 1994 .

[6]  John Amanatides,et al.  Ray tracing with cones , 1984, SIGGRAPH.

[7]  Donald P. Greenberg,et al.  Polygon shadow generation , 1978, SIGGRAPH.

[8]  W. Jack Bouknight,et al.  An algorithm for producing half-tone computer graphics presentations with shadows and movable light sources , 1899, AFIPS '70 (Spring).

[9]  Toshimitsu Tanaka,et al.  Shading with Area Light Sources , 1991, Eurographics.

[10]  George Drettakis,et al.  Simplifying the Representation of Radiance from Multiple Emitters , 1995 .

[11]  Dani Lischinski,et al.  Discontinuity meshing for accurate radiosity , 1992, IEEE Computer Graphics and Applications.

[12]  Andrew S. Glassner,et al.  MAINTAINING WINGED-EDGE MODELS , 1991 .

[13]  Steven K. Feiner,et al.  Fast object-precision shadow generation for area light sources using BSP trees , 1992, I3D '92.

[14]  Arthur Appel,et al.  Some techniques for shading machine renderings of solids , 1968, AFIPS Spring Joint Computing Conference.

[15]  Jitendra Malik,et al.  Computing the aspect graph for line drawings of polyhedral objects , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[16]  David F. Rogers,et al.  Mathematical elements for computer graphics , 1976 .

[17]  Paul S. Heckbert.  Radiosity in Flatland , 1992, Comput. Graph. Forum.

[18]  Seth J. Teller,et al.  Computing the antipenumbra of an area light source , 1992, SIGGRAPH.

[19]  Sudhir P. Mudur,et al.  Mathematical Elements for Computer Graphics , 1985, Advances in Computer Graphics.

[20]  A. James Stewart,et al.  An Output Sensitive Algorithm for the Computation of Shadow Boundaries , 1993, CCCG.

[21]  John Amanatides,et al.  A Fast Voxel Traversal Algorithm for Ray Tracing , 1987, Eurographics.

[22]  Daniel R. Baum,et al.  Improving radiosity solutions through the use of analytically determined form-factors , 1989, SIGGRAPH.

[23]  Donald S. Fussell,et al.  Adaptive mesh generation for global diffuse illumination , 1990, SIGGRAPH.

[24]  George Drettakis,et al.  Accurate and Consistent Reconstruction of Illumination Functions Using Structured Sampling , 1993, Comput. Graph. Forum.

[25]  Charles B. Morrey,et al.  Analytic Geometry in Three Dimensions , 1985 .

[26]  A. James Stewart,et al.  Fast computation of shadow boundaries using spatial coherence and backprojections , 1994, SIGGRAPH.

[27]  Paul S. Heckhert,et al.  Radiosity in Flatland , 1992 .