US2019087680A1PendingUtilityA1
Edge-Based Coverage Mask Compression
Est. expiryMar 25, 2035(~8.7 yrs left)· nominal 20-yr term from priority
G06T 1/60G06T 2200/12G06T 9/00G06K 9/4604G06T 15/005G06V 10/44G06T 2200/04G06T 7/13G06T 17/10
56
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
An index is assigned to each entry in the set of possible coverage masks and two functions are generated. One function translates an index to a coverage mask. Also, a sparse function generates an index from a coverage mask. These functions may be realized in hardware and are used during decompression and compression, respectively.
Claims
exact text as granted — not AI-modified1 . A method comprising:
storing a set of precompiled possible coverage masks for each of a plurality of multi-sample anti-aliasing (MSAA) rates, wherein a coverage mask indicates a portion of a pixel covered by a primitive being rendered; and accessing in a graphics processor for a given MSAA rate, a precompiled coverage mask for one of said entries.
2 . The method of claim 1 including assigning an index to entries in the set of precompiled possible coverage masks.
3 . The method of claim 2 including generating a sparse function to translate the coverage mask to an index to one of said entries.
4 . The method of claim 2 including assigning an index that can be represented by a predetermined number of bits.
5 . The method of claim 2 including using the index to select a corresponding mask from a table of masks.
6 . The method of claim 1 including using a balanced tree constructed from the coverage masks, where each node in the tree stores the corresponding mask.
7 . The method of claim 1 including allowing input masks that are not included in the possible coverage masks to generate an arbitrary index.
8 . The method of claim 7 including performing a mask index lookup followed by an index-to-mask lookup and verifying that the result is equal to the input mask.
9 . The method of claim 8 wherein if the results do not correspond to the input mask generating an error signal.
10 . The method of claim 1 including generating said precompiled coverage masks by pre-computing all possible coverage masks for at least four different multi sample anti-aliasing rates.
11 . One or more non-transitory computer readable media storing instructions executed by a graphics processor to perform a sequence:
storing a set of precompiled possible coverage masks for each of a plurality of multi-sample anti-aliasing (MSAA) rates, wherein a coverage mask indicates a portion of a pixel covered by a primitive being rendered; and accessing for a given MSAA rate, a precompiled coverage mask for one of said entries.
12 . The media of claim 11 , said sequence including assigning an index to entries in the set of precompiled possible coverage masks.
13 . The media of claim 12 , said sequence including generating a sparse function to translate the coverage mask to an index to one of said entries.
14 . The media of claim 12 , said sequence including assigning an index that can be represented by a predetermined number of bits.
15 . The media of claim 12 , said sequence including using the index to select a corresponding mask from a table of masks.
16 . The media of claim 11 , said sequence including using a balanced tree constructed from the coverage masks, where each node in the tree stores the corresponding mask.
17 . The media of claim 11 , said sequence including allowing input masks that are not included in the possible coverage masks to generate an arbitrary index.
18 . The media of claim 11 wherein said set of possible coverage masks is determined by looping over all combinations of two sample points, creating an edge equation with these points and groups of sampling points relative to that edge equation.
19 . The media of claim 11 , said sequence including generating said precompiled coverage masks by pre-computing all possible coverage masks for at least four different multi sample anti-aliasing rates.
20 . An apparatus comprising:
a graphics processor to store a set of precompiled possible coverage masks for each of a plurality of multi-sample anti-aliasing (MSAA) rates, wherein a coverage mask indicates a portion of a pixel covered by a primitive being rendered, and to access for a given MSAA rate, a precompiled coverage mask for one of said entries; and a storage coupled to said processor.
21 . The apparatus of claim 20 , said processor to assign an index to entries in the set of precompiled possible coverage masks.
22 . The method of claim 21 , said processor to generate a sparse function to translate the coverage mask to an index to one of said entries.
23 . The apparatus of claim 22 , said processor to assign an index that can be represented by a predetermined number of bits.
24 . The apparatus of claim 23 , said processor to use the index to select a corresponding mask from a table of masks.
25 . The apparatus of claim 20 , said processor to use a balanced tree constructed from the coverage masks, where each node in the tree stores the corresponding mask.
26 . The apparatus of claim 20 , said processor to allow input masks that are not included in the possible coverage masks to generate an arbitrary index.
27 . The apparatus of claim 26 , said processor to perform a mask index lookup followed by an index-to-mask lookup and verifying that the result is equal to the input mask.
28 . The apparatus of claim 27 wherein if the results do not correspond to the input mask, said processor to generate an error signal.
29 . The apparatus of claim 20 , said graphics processor to generate said precompiled coverage masks by pre-computing all possible coverage masks for at least four different multi sample anti-aliasing rates.
30 . The apparatus of claim 20 wherein said set of possible coverage masks is determined by looping over all combinations of two sample points, creating an edge equation with these points and groups of sampling points relative to that edge equation.Join the waitlist — get patent alerts
Track US2019087680A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.