摘要:
Methods and systems for decompressing data are described. The relative magnitudes of a first value and a second value are compared. The first value and the second value represent respective endpoints of a range of values. The first value and the second value each have N bits of precision. Either the first or second value is selected, based on the result of the comparison. The selected value is scaled to produce a third value having N+1 bits of precision. A specified bit value is appended as the least significant bit of the other (non-selected) value to produce a fourth value having N+1 bits of precision.
摘要:
A method of organizing memory for storage of texture data, in accordance with one embodiment of the invention, includes accessing a size of a mipmap level of a texture map. A block dimension may be determined based on the size the mipmap level. A memory space (e.g., computer-readable medium) may be logically divided into a plurality of whole number of blocks of variable dimension. The dimension of the blocks is measured in units of gobs and each gob is of a fixed dimension of bytes. A mipmap level of a texture map may be stored in the memory space. A texel coordinate of said mipmap level may be converted into a byte address of the memory space by determining a gob address of a gob in which the texel coordinate resides and determining a byte address within the particular gob.
摘要:
Methods and systems for decompressing data are described. The relative magnitudes of a first value and a second value are compared. The first value and the second value represent respective endpoints of a range of values. The first value and the second value each have N bits of precision. Either the first or second value is selected, based on the result of the comparison. The selected value is scaled to produce a third value having N+1 bits of precision. A specified bit value is appended as the least significant bit of the other (non-selected) value to produce a fourth value having N+1 bits of precision.
摘要:
Systems and methods for representing low dynamic range data in compressed formats with a fixed size block allow low dynamic range data to be stored in less memory. The compressed formats use 8 bits per pixel to represent 24 bits of low dynamic range data for each pixel. The compressed format includes four or six endpoint values, a partition index that specifies a mask for each pair of the endpoint values, and an index for each pixel in the block. The indices are compressed to allow more bits for the endpoint values. Mode bits are included to distinguish between the different encodings and various blocks within a single compressed image may be encoded differently. Compressed low dynamic range values may be efficiently decompressed in hardware.
摘要:
Systems and methods for representing high dynamic range data in compressed formats with a fixed size block allow high dynamic range data to be stored in less memory. The compressed formats use 8 bits per pixel. A first compressed format includes two endpoint values and an index for each pixel in the block. A second compressed format includes four endpoint values, a partition index that specifies a mask for each pair of the four endpoint values, and an index for each pixel in the block. The two formats may be used for various blocks within a single compressed image and mode bits are included to distinguish between the two formats. Furthermore, each endpoint value may be encoded using an endpoint compression mode that is also specified by the mode bits. Compressed high dynamic range values represented in either format may be efficiently decompressed in hardware.
摘要:
Systems and methods compress and decompress 16 bit data. The 16 bit data may be signed or unsigned and represented in a fixed point or floating point format. A fixed block size of data is compressed into a fixed length format. Data compressed using a medium quality compression scheme may be efficiently decompressed in hardware. Data may be efficiently compressed and decompressed in hardware using a high quality compression scheme. The high quality compression scheme has a lower compression ratio compared with the medium quality compression scheme, but is near lossless in terms of quality.
摘要:
A system, method and computer program product are provided for programmable pixel processing in a computer graphics pipeline. In one embodiment of the present invention, arbitrary texture filtering is applied via a programmable shader.
摘要:
Trilinear optimization is a technique to reduce the number of texture samples used to determine a texture value associated with a graphics fragment. Bilinear interpolations replace some trilinear interpolations, thereby reducing the number of texture samples read and simplifying the filter computation. A programmable trilinear slope is used to control replacement of a trilinear computation with a bilinear computation, permitting a user to determine a balance between improved texture map performance and texture filtering quality.
摘要:
A method and apparatus for performing post-process antialiasing of polygon edges. According to one aspect of the invention, a method is provided for modifying the color of a pixel in a texture mapped representation of an image generated from a plurality of polygons. According to this method, it is determined that an edge of one of the plurality of polygons intersects a scan line in the texture mapped representation at an intersection point. In addition, the pixel within which this intersection point lies is determined. The color for this pixel is identified by pixel data stored as part of the texture mapped representation. A filter is performed using the texture mapped representation as an input texture map by: 1) determining a texture point in the input texture map that corresponds to the intersection point; 2) performing a filter on texels in the input texture map identified by that texture point to determine a corrected color for the pixel; and 3) altering the pixel data stored as part of the texture mapped representation for the pixel containing the intersection point to indicate the corrected color. According to another aspect of the invention, the filter used in this method is either a linear filter, a bilinear filter, a quadratic filter, or a cubic filter. According to another aspect of the invention, the step of performing the filter is performed using the same hardware used for performing the texture mapping of the texture mapped representation.
摘要:
One embodiment of the present invention sets forth a technique for converting alpha values into pixel coverage masks. Geometric coverage is sampled at a number of “real” sample positions within each pixel. Color and depth values are computed for each of these real samples. Fragment alpha values are used to determine an alpha coverage mask for the real samples and additional “virtual” samples, in which the number of bits set in the mask bits is proportional to the alpha value. An alpha-to-coverage mode uses the virtual samples to increase the number of transparency levels for each pixel compared with using only real samples. The alpha-to-coverage mode may be used in conjunction with virtual coverage anti-aliasing to provide higher-quality transparency for rendering anti-aliased images.