Abstract: Method and apparatus for synthesizing element arrangements from an example. Embodiments may synthesize element arrangement patterns from an example arrangement. Embodiments may combine a texture synthesis technique based on local neighborhood comparison of an example and a target with procedural modeling based on local growth. Given an example, connectivity of elements may be constructed to get neighborhoods information of each element. A synthesis process may start with a single seed and expand the synthesized pattern by placing new elements at seed locations one by one. A reference element may be selected from the example that has neighborhood features that are most similar to neighborhood features of the target seed in the synthesized pattern. A non-rotation mode, a rotation mode, and a flow field mode may be provided. A painting tool, a flow field tool, and a boundary tool may be provided.

Abstract: Glossy reflections may include areas that are less clear (more blurry) than other regions. For instance, an area of reflection that is closer to the object being reflected may appear clearer than a region that is farther from the object. When generating a glossy reflection, the total amount of light reaching each point on the reflecting surface is calculated according to a spatially-varying convolution kernel of the transparency information for the image being reflected. Ray-tracing, traditionally used to determine a spatially varying convolution, can be very CPU intensive. Instead of using ray-tracing, data structures, such as MIP-maps and summed-area tables, or separable linear filters may be used to compute the spatially-varying convolution. For example, a two-dimensional convolution may be computed as two spatially-varying, separable, linear convolution filters—one computing a horizontal component and the other a vertical component of the final 2D convolution.

Abstract: Soft shadows may include areas that are less clear (more blurry) than other regions. For instance, an area of shadow that is closer to the shadow caster may be clearer than a region that is farther from the shadow caster. When generating a soft shadow, the total amount of light reaching each point on the shadow receiving surface is calculated according to a spatially-varying convolution kernel of the occluder's transparency information. Ray-tracing, traditionally used to determine a spatially varying convolution, can be very CPU intensive. Instead of using ray-tracing, data structures, such as MIP-maps and summed-area tables, or separable linear filters may be used to compute the spatially-varying convolution. For example, a two-dimensional convolution may be computed as two spatially-varying, separable, linear convolution filters—one computing a horizontal component and the other a vertical component of the final 2D convolution.

Abstract: A system and method for performing integral histogram convolution for filtering image data is disclosed. The method may include generating an initial histogram for a kernel region of an input image comprising two or more column histograms. Each histogram may include a plurality of bucket values, each representing a sum of weights associated with pixels having the same value or a count of pixels having the same value. The method may include incrementally generating a region histogram for each successive region of the image as the kernel is passed over the image and applying a convolution operation to it. Generating the new region histogram may involve merging an additional column histogram with the initial or current region histogram, and may also involve subtracting values of a preceding column histogram from the initial or current histogram. The methods may be implemented by program instructions executing in parallel on CPU(s) or GPUs.

Abstract: A system and method for shallow water simulation may provide a framework for solving General Shallow Wave Equations (GSWE) to efficiently simulate 3D fluid effects on arbitrary surfaces using a height field representation. The height field representation may include height columns constructed along surface normals, which may be dependent on a condition of boundary cells adjacent to fluid cells and/or artificial viscosity effects. The framework may provide implicit schemes for solving for the effects of external forces applied to the fluid, including gravity and surface tension, and explicit schemes for solving for advection effects. The system and method may be implemented on general-purpose CPU(s) and/or GPU(s) and may be capable of simulating a variety of fluid effects including: waves, rivulets and streams, drops, and capillary events. In some embodiments, the system and method may achieve real-time fluid control and fluid shape design through user-interaction (e.g., in a graphical painting application).

Abstract: The invention enables and/or facilitates the display of personalized content to content observers by content providers (e.g., advertisers) who disseminate content over a network. The invention enables identification of particular content observers at a content display site using analysis of content observation behavior at a content display site, data regarding one or more physical characteristics of content observers in the vicinity of the content display device during display of particular content, and/or analysis of demographic characteristics of possible content observers at the content display site. The invention prevents unauthorized access to data produced as part of identification of the content observer.

Abstract: A hierarchical Z-buffer scan-conversion algorithm that does well on both (a) quickly rejecting most of the hidden geometry in a model, and (b) exploiting the spatial and temporal coherence of the images being generated. The method uses two hierarchical data structures, an object-space octree and an image-space Z-pyramid, in order to accelerate scan conversion. The two hierarchical data structures make it possible to reject hidden geometry very rapidly while rendering visible geometry with the speed of scan conversion. For animation purposes, the algorithm is also able to exploit temporal coherence. The resulting method is well suited to models with high depth complexity, achieving significant speedup in some cases compared to ordinary scan conversion.

Abstract: A method and apparatus for rendering textured spheres and spherical environment maps. The method of the present invention provides for real time rotation of a textured sphere and panning of the view into a spherical environment map, along multiple axes without the need for special rendering hardware. A two-level indexing scheme for accessing pixel data in a texture map, is used to identify shading values for pixels in a display window. The two-level indexing scheme is comprised of a screen look-up table and a parametric look-up table. The screen look-up table has the dimensions of the display window, whereas the parametric look-up table has the dimensions of the parametric spherical environment map (wherein the pixel addresses are rotated 90 degrees from the origin).

Abstract: A system for bit-masked color signal scaling comprises a processing unit, a display device, and a memory wherein a scaling unit, an image memory, a multiplication image memory, an approximation image memory, an approximation multiplication image memory, and a scaled image memory reside. The scaling unit retrieves a color signal having a red channel signal, a green channel signal, and a blue channel signal from the image memory, and performs either an exact or an approximate bit-masked color signal scaling. A method for exact bit-masked color signal scaling comprises the steps of: generating a staggered masking signal; generating a center masking signal; generating a staggered result signal; generating a center result signal; and adding the staggered result signal and the center result signal to produce a scaled color signal.

Abstract: A system for shading graphic images for realistic rendering representative of tarnish accumulation has a display device, a central processing unit, an input device, and a memory means. The memory includes image components, shading routines, accessibility routines, display routines, and a texture map. The system modifies each image prior to display to apply shading. The system uses the accessibility routines to produce an accessibility factor for each pixel in the image. The accessibility factor is then used by the display routines to apply the desired shading to each pixel as it is rendered on the display device.

Abstract: A method and apparatus for rendering textured spheres and spherical environment maps. The method of the present invention provides for real time rotation of a textured sphere and panning of the view into a spherical environment map, along multiple axes without the need for special rendering hardware. A two-level indexing scheme for accessing pixel data in a texture map, is used to identify shading values for pixels in a display window. The two-level indexing scheme is comprised of a screen look-up table and a parametric look-up table. The screen look-up table has the dimensions of the display window, whereas the parametric look-up table has the dimensions of the parametric spherical environment map (wherein the pixel addresses are rotated 90 degrees from the origin).

Abstract: A method and apparatus for generating perspective views of a scene. With a viewing position at the center of to be cylindrical environment map, different views can be obtained by rotating the viewing direction either horizontally or vertically. The horizontal construction method of the present invention generally involves the steps of: determining the portion of the cylindrical map to be viewed; vertically interpolating pixel values in the portion of the cylindrical map to be viewed and mapping to a viewing plane; and displaying the viewing plane. The vertical construction method of the present invention generally involves the steps of: determining the portion of the cylindrical map to be viewed; vertically interpolating pixel values in the portion of the cylindrical map robe viewed and mapping to a vertical plane; horizontally interpolating pixel values in the vertical plane and mapping to the viewing plane; and displaying the viewing plane.

Abstract: An adaptive compression/decompression method for color video data with an anti-aliasing mode. 4.times.4 blocks of pixel data are examined to determine which one of four compression techniques should be used on each block. User settable thresholds can be used to shift the types of compression used. Highest compression is obtained when more data is stored in run length blocks of single colors and lowest compression when more data is stored as two colors with a 32-bit bitmap for each 4.times.4 block. One type of compression used provides anti-aliasing.