Abstract: A rasterizer, based on time-dependent edge equations, computes analytical visibility in order to render accurate motion blur. An oracle-based compression algorithm for the time intervals lowers the frame buffer requirements. High quality motion blurred scenes can be rendered using a rasterizer with rather low memory requirements. The resulting images may contain motion blur for both opaque and transparent objects.

Abstract: A rasterizer, based on time-dependent edge equations, computes analytical visibility in order to render accurate motion blur. An oracle-based compression algorithm for the time intervals lowers the frame buffer requirements. High quality motion blurred scenes can be rendered using a rasterizer with rather low memory requirements. The resulting images may contain motion blur for both opaque and transparent objects.

Abstract: Embodiments relate to compression and decompression of textures. A texel block (10) is compressed by specifying two major directions in the texel block (10) and defining the profiles of how the texel values change along the respective directions. The resulting compressed texel block (30) comprises two value codewords (31, 32), two line codewords (35-38) and a function codeword (33, 34). The two value codewords (31, 32) are employed to calculate two texel values for the texel block (10). The line codewords (35-38) are employed to determine equations of two lines (20, 22) coinciding with the two major directions in the texel block (10). Signed distances are calculated for each texel (12) from the texel position in the texel block (10) and to the two lines (20, 22). The signed distances are input to a function defined by the function codeword (33, 34) to output two values from which weights are calculated and applied to the two texel values in order to get a representation of the texel value of a texel (12).

Abstract: A rasterizer, based on time-dependent edge equations, computes analytical visibility in order to render accurate motion blur. An oracle-based compression algorithm for the time intervals lowers the frame buffer requirements. High quality motion blurred scenes can be rendered using a rasterizer with rather low memory requirements. The resulting images may contain motion blur for both opaque and transparent objects.

Abstract: Embodiments relate to compression and decompression of textures. A texel block (10) is compressed by specifying two major directions in the texel block (10) and defining the profiles of how the texel values change along the respective directions. The resulting compressed texel block (30) comprises two value codewords (31, 32), two line codewords (35-38) and a function codeword (33, 34). The two value codewords (31, 32) are employed to calculate two texel values for the texel block (10). The line codewords (35-38) are employed to determine equations of two lines (20, 22) coinciding with the two major directions in the texel block (10). Signed distances are calculated for each texel (12) from the texel position in the texel block (10) and to the two lines (20, 22). The signed distances are input to a function defined by the function codeword (33, 34) to output two values from which weights are calculated and applied to the two texel values in order to get a representation of the texel value of a texel (12).

Abstract: A method and apparatus for angular invariant texture level of detail calculation is disclosed. The method includes a determination for a LOD that determines angular invariant LODs that result in efficient ASIC hardware implementation.

Abstract: A rasterizer, based on time-dependent edge equations, computes analytical visibility in order to render accurate motion blur. An oracle-based compression algorithm for the time intervals lowers the frame buffer requirements. High quality motion blurred scenes can be rendered using a rasterizer with rather low memory requirements. The resulting images may contain motion blur for both opaque and transparent objects.

Abstract: A graphics processing circuit includes a pixel shader operative to provide pixel color information in response to image data representing a scene to be rendered; a texture circuit, coupled to the pixel shader, operative to determine a luminance value to be applied to a pixel of interest based on the luminance values of the pixels that define a plane including the pixel of interest; and a render back end circuit, coupled to the texture circuit, operative to compute the luminance values from a shadow map that specifies the distance from the light source of the nearest object at a plurality of locations.

Abstract: A method and apparatus for angular invariant texture level of detail calculation is disclosed. The method includes a determination for a LOD that determines angular invariant LODs that result in efficient ASIC hardware implementation.

Abstract: A memory architecture for use in a graphics processor including a main memory, a level one (L1) cache and a level two (L2) cache, coupled between the main memory and the L1 cache is disclosed. The L2 cache stores overlapping requests to the main memory before the requested information is stored in the L1 cache. In this manner, overlapping requests for previously stored information is retrieved from the faster L2 cache as opposed to the relatively slower main memory.

Abstract: A graphics processing circuit includes a pixel shader operative to provide pixel color information in response to image data representing a scene to be rendered; a texture circuit, coupled to the pixel shader, operative to determine a luminance value to be applied to a pixel of interest based on the luminance values of the pixels that define a plane including the pixel of interest; and a render back end circuit, coupled to the texture circuit, operative to compute the luminance values from a shadow map that specifies the distance from the light source of the nearest object at a plurality of locations.

Abstract: A memory architecture for use in a graphics processor including a main memory, a level one (L1) cache and a level two (L2) cache, coupled between the main memory and the L1 cache is disclosed. The L2 cache stores overlapping requests to the main memory before the requested information is stored in the L1 cache. In this manner, overlapping requests for previously stored information is retrieved from the faster L2 cache as opposed to the relatively slower main memory.