Abstract: Techniques are disclosed to determine the irradiance from a disk light source with much higher accuracy than may be obtained using the common approximation often used currently. By pre-computing, SH coefficients using a specific coordinate frame, only six SH coefficients need to be stored in a first and second texture, one used to determine irradiance of a point within the radius of a disk light source and another for more distant points.

Abstract: A technique for physically-based cloth simulation uses linear upsampling operators. The upsampling operators enrich the appearance of a coarse mesh physical cloth simulation. The technique starts by pre-computing the upsampling operators using a pair of coarse and fine training simulations aligned with tracking constraints using harmonic test functions. Then the upsampling operators are trained using a novel regularization technique that enables mid-scale detail learning without over-fitting. Oscillatory modes may be introduced to add dynamic details not captured by the coarse mesh simulation alone. Trained upsampling operators can then be advantageously applied to coarse mesh simulations of cloth to add realistic detail to the cloth in real-time three-dimensional applications.

Abstract: Techniques are disclosed for using a local lighting representation to explicitly model spatial variation of a character in a graphics scene as well as for using error driven criteria to determine whether to evaluate a given light source analytically or in a lighting rig. For near light sources, the error driven criteria may be used to determine when a spherical light source should be evaluated in the lighting rig verses analytically. For large characters, local irradiance models may be used to provide a limited form of spatial variation.

Abstract: Techniques are disclosed to determine the irradiance from a disk light source with much higher accuracy than may be obtained using the common approximation often used currently. By pre-computing, SH coefficients using a specific coordinate frame, only six SH coefficients need to be stored in a first and second texture, one used to determine irradiance of a point within the radius of a disk light source and another for more distant points.

Abstract: Modular radiance transfer pre-computes a spectral decomposition of a one bounce transport operator for each of a set of shapes and replaces a scene dependent direct-to-indirect transfer lighting computation with an art-directable mapping step. Modular radiance transfer provides an approach for rendering an approximate indirect lighting which requires small amounts of data, can be used to model very large (or even random scenes), and propagates much of the indirect lighting using a small number of spectral coefficients, so that rendering scales well to large scenes.

Abstract: A system and method for performing a scan of an input sequence in a parallel processor having a shared register file. A two dimensional matrix is generated, having a number of rows representing a number of threads and a number of columns based on the input sequence block size and the number of rows. One or more padding columns may be added to the matrix to avoid or reduce memory bank conflicts. A first traversal of the rows performs a reduction or a scan of each of the rows in parallel, storing the reduction values. The reduction values are used during a second traversal to propagate the reduction values. In a segmented scan, propagation is selectively performed based on flags representing segment boundaries.

Abstract: Shape animation is described. In one aspect, examples that pertain to a shape or motion that is to be animated are provided. The examples are placed within a multi-dimensional abstract space. Each dimension of the abstract space is defined by at least one of an adjective and an adverb. A point within the multi-dimensional abstract space is selected. The selected point does not coincide with a point that is associated with any of the examples. The selected point corresponds to a shape or motion within the abstract space. A single weight value for each of the examples is computed. The single weight values for each of the examples are combined in a manner that defines an interpolated shape or motion that is a blended combination of each of the examples of the set of examples.

Abstract: Real-time image rendering of diffuse and glossy objects in low-frequency lighting environments captures soft shadows, interreflections, and caustics. As a preprocess, a global transport simulator creates functions over the object's surface representing transfer of arbitrary, low-frequency source lighting into exiting radiance, but including global effects like shadowing and interreflection from the object onto itself. At run-time, these transfer functions are applied to the actual source lighting. Dynamic, local lighting is handled by sampling close to the object at every frame; the object can also be rigidly rotated with respect to the lighting and vice versa. Lighting and transfer functions are represented using low-order spherical harmonics. Functions for radiance transfer from a dynamic lighting environment through a preprocessed object to neighboring points in space further allow cast soft shadows and caustics from rigidly moving casters onto arbitrary, dynamic receivers.

Abstract: A technique for rendering non-linear BRDFs that are stable in both the temporal and spatial domains, without serious interruption to the content creation pipeline used in most games, is provided. Non-linear content is linearized by rendering in texture space at a fixed resolution. A MIP-map chain is calculated from this texture. The complete MIP-map chain is used for rendering on a display device. Low resolution reflectance parameters are used to approximate the highest resolution reflectance parameters as the object becomes smaller on the display device. The low resolution reflectance parameters are calculated using non linear fitting techniques.

Abstract: Systems and methods for shape animation are described. In one aspect, a degree of freedom is linearly approximated. The degree of freedom is associated with a new form or motion for rendering based on multiple examples that define respective forms or motions within a multi-dimensional abstract space. Each dimension of the abstract space is defined by at least one of an adjective and an adverb. A radial basis function is defined for each of the examples by scaling the radial basis function for each example. The scaling includes evaluating a matrix system to ascertain a plurality of scaling weights. Individual weights are used to scale the radial basis functions. The linear approximation and the radial basis functions are combined to provide a cardinal basis function. The cardinal basis function is used to render the new form or motion.

Abstract: Shadows, which play an important role in perceiving the shape and texture of an object, are simulated interactively in a real time, self-shadowing of a bump mapped surface for a computer rendered object. A computer graphics textured object function defines a horizon map over an orientation in a tangent space of the object using different textures or basis functions. The implementation can be performed using commodity graphics hardware by precomputing the horizon map for limited visibility for each point on the bump mapped surface given light in each of a plurality of radial directions. The horizon map is used to produce self-shadowing of the bump mapped surface of the object.

Abstract: Real-time processing includes per-point transfer matrices forming a high-dimensional surface signal that is compressed using clustered principal component analysis (CPCA). CPCA partitions multiple samples into fewer clusters, each cluster approximating the signal as an affine subspace. Further, source radiance is input to a processor, which approximates source radiance using spherical harmonic basis to produce a set of source radiance coefficients. A graphics processing unit (GPU) processes the source radiance coefficients through the transfer matrix model for each cluster. The result of such processing is the exit radiance, which parameterizes the radiance leaving the surface of the object at each point, thus producing the shading for each point of the virtual object in real time.

Abstract: Shadows, which play an important role in perceiving the shape and texture of an object, are simulated interactively in a real time, self-shadowing of a bump mapped surface for a computer rendered object. A computer graphics textured object function defines a horizon map over an orientation in a tangent space of the object using different textures or basis functions. The implementation can be performed using commodity graphics hardware by precomputing the horizon map for limited visibility for each point on the bump mapped surface given light in each of a plurality of radial directions. The horizon map is used to produce self-shadowing of the bump mapped surface of the object.

Abstract: Computer graphics image rendering techniques render images using a precomputed radiance transfer (PRT) to model local effects such as bumps, wrinkles, or other detailed features on an arbitrarily deformable model's surface. The techniques apply zonal harmonics (ZH) which approximate spherical functions as sums of circularly symmetric functions around different axes. By spatially varying both the axes and coefficients of these basis functions, approximations can fit to spatially varying transfer signals. Compared to the spherical harmonic (SH) basis, the ZH basis yields a more compact approximation, and can be rotated at a low computational expense suitable for dense per-vertex or per-pixel evaluation. This allows PRT to be mapped onto deforming models which re-orient the local coordinate frame.

Abstract: Shadows, which play an important role in perceiving the shape and texture of an object, are simulated interactively in a real time, self-shadowing of a bump mapped surface for a computer rendered object. A computer graphics textured object function defines a horizon map over an orientation in a tangent space of the object using different textures or basis functions. The implementation can be performed using commodity graphics hardware by precomputing the horizon map for limited visibility for each point on the bump mapped surface given light in each of a plurality of radial directions. The horizon map is used to produce self-shadowing of the bump mapped surface of the object.

Abstract: Modern animation and modeling systems enable artists to create high-quality content, but provide limited support for interactive applications. Although complex forms and motions can be constructed either by hand or with motion or geometry capture technologies, once they are created, they are difficult to modify, particularly at runtime. Interpolation provides a way to leverage artist-generated source material. Presented here are methodologies for efficient runtime interpolation between multiple forms or multiple motion segments. Radial basis functions provide key mathematical support for the interpolation. Once the illustrated and described system is provided with example forms and motions, it generates a continuous range of forms referred to as a “shape” or a continuous range of motions referred to as a verb. Additionally, shape interpolation methodology is applied to articulated figures to create smoothly skinned figures that deform in natural ways.

Abstract: Shape animation is described. In one aspect, examples that pertain to a shape or motion that is to be animated are provided. The examples are placed within a multi-dimensional abstract space. Each dimension of the abstract space is defined by at least one of an adjective and an adverb. A point within the multi-dimensional abstract space is selected. The selected point does not coincide with a point that is associated with any of the examples. The selected point corresponds to a shape or motion within the abstract space. A single weight value for each of the examples is computed. The single weight values for each of the examples are combined in a manner that defines an interpolated shape or motion that is a blended combination of each of the examples of the set of examples.

Abstract: Systems and methods for shape animation are described. In one aspect, a degree of freedom is linearly approximated. The degree of freedom is associated with a new form or motion for rendering based on multiple examples that define respective forms or motions within a multi-dimensional abstract space. Each dimension of the abstract space is defined by at least one of an adjective and an adverb. A radial basis function is defined for each of the examples by scaling the radial basis function for each example. The scaling includes evaluating a matrix system to ascertain a plurality of scaling weights. Individual weights are used to scale the radial basis functions. The linear approximation and the radial basis functions are combined to provide a cardinal basis function. The cardinal basis function is used to render the new form or motion.

Abstract: Shadows, which play an important role in perceiving the shape and texture of an object, are simulated interactively in a real time, self-shadowing of a bump mapped surface for a computer rendered object. A computer graphics textured object function defines a horizon map over an orientation in a tangent space of the object using different textures or basis functions. The implementation can be performed using commodity graphics hardware by precomputing the horizon map for limited visibility for each point on the bump mapped surface given light in each of a plurality of radial directions. The horizon map is used to produce self-shadowing of the bump mapped surface of the object.

Abstract: A technique for solving an inverse-kinematic problem by interpolating solutions from examples. Example poses or motions of an object are collected and annotated. The annotations are essentially parameters for a function—i.e., the function X(p) generates degree-of-freedom values of an object that is posed in a manner that satisfies parameters p. The analytic function X is interpolated from these examples and improved automatically based on kinematic measurements. Preferably, the interpolation is created by taking a weighted sum of cardinal basis functions having linear and radial parts, Preferably, the interpolation is a weighted sum of cardinal basis functions having linear and radial portions.