Computing exact shadow irradiance using splines (original) (raw)
Related papers
Exact radiosity reconstruction and shadow computation using vertex tracing
2000
Methods for exact computation of irradiance and form factors associated with polygonal objects have ultimately relied on a formula for a differential area to polygon form factor attributed to Lambert. This paper introduces an alternative to Lambert's formula, an analytical expression which independent of the vertex order of the polygon. In this formulation, irradiance values in a scene consisting of partially occluded uniformly emitting polygons can be computed exactly by examining only the set of apparent vertices visible from the point of evaluation, where no vertex ordering is required. The method is particularly applicable to radiosity reconstruction, in which all the scene polygons are diffuse emitters, and also in environments where efficiency structures have already been established.
Real time volumetric shadows using polygonal light volumes
This paper presents a more efficient way of computing single scattering effects in homogeneous participating media for real-time purposes than the currently popular ray-marching based algorithms. These effects include halos around light sources, volumetric shadows and crepuscular rays. By displacing the vertices of a base mesh with the depths from a standard shadow map, we construct a polygonal mesh that encloses the volume of space that is directly illuminated by a light source. Using this volume we can calculate the airlight contribution for each pixel by considering only points along the eye-ray where shadow-transitions occur. Unlike previous ray-marching methods, our method calculates the exact airlight contribution, with respect to the shadow map resolution, at real time frame rates.
A fast shadow algorithm for area light sources using backprojection
Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94, 1994
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.
2001
Shadows are important elements in creating a realistic image and in providing the user with visual cues about object placement. A review of many different shadow algorithms is found in the survey published by Woo et al. [23] and in Watt and Watt's book [21]. Here we will present the most important real-time algorithms for dynamic shadows. The first section handles the special case of shadows cast on planar surfaces, and the second section covers more general shadow algorithms, i.e., casting shadows onto arbitrary surfaces.
Light propagation for mixed polygonal and volumetric data
International 2005 Computer Graphics, 2005
This paper describes a shadow and soft shadow algorithm for mixed polygonal and volumetric data. The polygons are first rendered using scanline rasterization and the depth information is retrieved. Volume rendering using splatting is then used to render the volumes. Polygons are composited with volumes during the volume rendering in depth-sorted order slice by slice. We implement shadow and soft shadow algorithms, combining volumes and polygons using sheet-based splatting. This shadow algorithm applies to all combinations of volumes and polygons, without any restriction on the geometric positioning and overlap of the volumes and polygons. This paper also discusses how to implement multiple scattering for high-albedo participating media during the shadow generation using sheet-based splatting. We use a convolution technique to model the multiple forward and back scattering and show results for clouds, a high-albedo participating medium. Our algorithm constitutes a complete system for shadow generation.
A comparison of three shadow volume algorithms
The Visual Computer, 1992
This paper describes and compares three different approaches to computing shadows each based on the idea of shadow volumes, a basic algorithm, the Shadow Volume BSP Tree algorithm, and a third based on 2D space subdivision, Shadow Tiling. Binary Space Partition trees are used to organise the polygons in the scene in a frontto-back order from the point of view of the light source, and then shadows on a polygon are computed by clipping the polygon to the shadow volumes of polygons closer to the light source. The three algorithms differ in their approach to minimising the number of comparisons of a polygon with the shadow volumes of its predecessors, and one of the algorithms represents the total shadow volume itelf by a BSP tree. The algorithms are compared analytically and statistically.
IEEE Computer Graphics and Applications, 2000
Essential to realistic and visually appealing images, shadows are difficult ta compute in most display environments. This survey characterizes the various types of shadows. It also describes most existing shadow algorithms and discusses their complexities, advantages, and shommings. We examine herd shadows, soft shadbws, shadows of transparent objects, and shadows for com-plex modeling primitives. For each type, we examine shadow algorithms within various rendswing techniques. This survey attempts to provide readem with enough background and insight on the various rmthods to d o w them to choose the algorithm best w p u i t e d to their W . We also hope that our analysis will h&p identify the a m that need more research and point bo possible sotutkms.
Shadow modelling based upon Rayleigh scattering and Mie theory
In this paper, we present a method to model shadows in outdoor scenes. Here, we note that the shadow areas correspond to the diffuse skylight which arises from the scattering of the sunlight by particles in the atmosphere. This yields a treatment in which shadows in the image can be viewed as a linear combination of scattered light obeying Rayleigh scattering and Mie theory. This allows for the computation of a ratio which permits casting the problem of recovering the shadowed areas in the image into a clustering setting making use of active contours. This also opens-up the formulation of a metric that can be used to assess the degree upon which the scene is overcast. We illustrate the utility of the method for purposes of detecting shadows in real-world imagery, provide time complexity results and compare against a number of alternatives elsewhere in the literature.
A New Coherent Technique for Real-Time Shadow Generation with Respect to the Sun’s Position
Soft shadow with respect to the sun's position in virtual environments is a fascinating topic in outdoor rendering. A coherent mathematic formula to create shadow with respect to the sun's position in specific location, date and time can make outdoor rendering as easy as indoor rendering. A target of this study is to propose a new coherent formula to do this. Outdoor rendering using a coherent formula will eliminate worrying about the sun's position and shadow status during the daytime. Low frames per second (FPS) in real-time rendering is a crucial problem in computer graphics, especially in soft shadow generation. A novel technique to create soft shadow in virtual environments is proposed. Geometric progression to select the color and a combination formula using sequence progression are proposed to determine the sample size. The new soft shadow generation, in addition to increasing FPS, enhances the quality of soft shadows. Finally, we strongly contend that the proposed technique can be used in commercial gaming and virtual reality systems.
Shading and shadowing with linear light sources
Computers & graphics, 1991
In virtually all rendering systems, linear light sources are modeled with a series of point light sources that require considerable computing resources to produce realistic looking results. A general solution for shading surfaces illuminated by a linear light source is proposed. A formulation allowing for faster computation of the di use component o f light re ection is derived. By assuming Phong's specular component, simple, inexpensive and convincing results are produced with the use of a Chebyshev approximation. A shadowing algorithm is also presented. As shadowing from linear light sources is expensive, two acceleration schemes, extended from ray tracing, are evaluated.