摘要:
It is presented a method for improving performance of generation of digitally represented graphics. Said method comprises the steps of: selecting (440) a tile comprising fragments to process; executing (452) a culling program for the tile, the culling program being replaceable; and executing a set of instructions, selected from a plurality of sets of instructions based on an output value of the culling program, for each of a plurality of subsets of the fragments. A corresponding display adapter and computer program product are also presented.
摘要:
Techniques related to graphics rendering including techniques for color compression and/or decompression using adaptive quantization are described.
摘要:
It is presented a method for improving performance of generation of digitally represented graphics. Said method comprises the steps of: selecting (440) a tile comprising fragments to process; executing (452) a culling program for the tile, the culling program being replaceable; and executing a set of instructions, selected from a plurality of sets of instructions based on an output value of the culling program, for each of a plurality of subsets of the fragments. A corresponding display adapter and computer program product are also presented.
摘要:
A pixel block (300) is compressed by providing a respective color component prediction for each pixel (310-318) in the block (300). A difference between color components of two neighboring pixels (312, 316) is calculated and compared to a threshold. If the difference is smaller than the threshold, the prediction is calculated based on a first linear combination of the color components of these two neighboring pixels (312, 316). However, if the difference exceeds the threshold, a second or third linear combination of the color components of the neighboring pixels (312, 316) is employed a prediction. A guiding bit (470) associated with the selected linear combination. A prediction error is calculated based on the color component of the pixel (318) and the provided prediction. The compressed block (400) comprises an encoded representation (480) of the prediction error and any guiding bit (470).
摘要:
A method for updating values of a depth buffer comprising values for display blocks of a display, and a device for implementing the method. The display is partitioned into a plurality of display regions, including a plurality of display blocks and having a minimum region depth value and a maximum region depth value. Each display region includes a plurality of display subregions. A minimum subregion depth value and a maximum subregion depth value are determined relative to at least one of the minimum region depth value and the maximum region depth value.
摘要:
In an image-encoding scheme, an input image is decomposed into several image blocks (600) comprising multiple image elements (610), e.g. pixels or texels. The image blocks (600) are then encoded into encoded block representations (700). Such a block representation (700) comprises a color codeword (710), an intensity codeword (720) and a sequence (730) of intensity representations. The color codeword (710) is a representation of the colors of the image elements (610) of the block (600). The intensity codeword (720) is a representation of a set of multiple intensity modifiers for modifying the intensity of the image elements (610) in the block (600). The representation sequence (730) includes an intensity representation for each image element (610) in the block (600), where a representation identifies one of intensity modifiers in the intensity modifier set. During decoding, the color and intensity codewords (710, 720) and intensity representations (730) are used to generate a decoded representation of the image elements (610) in the block (600).
摘要:
A pixel block (300) is losslessly compressed into a candidate compressed block. If the bit length of the candidate block exceeds a threshold value, the property values of the pixels (310-317) in the block (300) are quantized and the quantized values are losslessly compressed into a new candidate compressed block. The procedure is repeated until a candidate compressed block having good image quality and a bit length below the threshold value is found. A compressed representation (400) of the block (300) is determined based on the found candidate compressed block (420) and an identifier (410) of the used quantization parameter.
摘要:
A pixel block (300) is compressed by determining a reference set of multiple reference property values (10-14). A value index associated with a reference property value of the reference set is assigned to each pixel (310-316) in the pixel block (300) based on the original property value of the pixel (310-316). A prediction of the value index is provided based on the value index assigned to at least one neighboring pixel (314, 316) in the pixel block (300). A prediction error is calculated based on the value index assigned to a pixel (316) and its value index prediction. The compressed pixel block (400) comprises encoded representations (424) of the prediction errors and an encoded representation (410) of the reference set.
摘要:
A pixel block is compressed by providing a respective color component prediction for each pixel in the block. A difference between color components of two neighboring pixels is calculated and compared to a threshold. If the difference is smaller than the threshold, the prediction is calculated based on a first linear combination of the color components of these two neighboring pixels. However, if the difference exceeds the threshold, a second or third linear combination of the color components of the neighboring pixels is employed in the prediction. A guiding bit associated with the selected linear combination may be used. A prediction error is calculated based on the color component of the pixel and the provided prediction. The compressed block comprises an encoded representation of the prediction error and any guiding bit.
摘要:
A sample-sharing pattern covering a set of pixels for use in an anti-aliasing system where each pixel has a pattern of sample points. A first sampling point is provided at a corner of the pixel, and second and third sampling points are provided at separate borders of the pixel, which do not intersect the corner sample. Moreover, the sample point pattern of each pixel is a mirror image of and different from the pattern of a neighboring pixel.