Method and system for multisample antialiasing
US-9275492-B2 · Mar 1, 2016 · US
US12159347B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12159347-B2 |
| Application number | US-202217852288-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jun 28, 2022 |
| Priority date | Nov 8, 2011 |
| Publication date | Dec 3, 2024 |
| Grant date | Dec 3, 2024 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method and system for generating two or three dimensional computer graphics images using multisample antialiasing (MSAA) is provided, which enables memory bandwidth to be conserved. For each of one or more pixels it is determined whether all of a plurality of sample areas of that pixel are located within a particular primitive. For those pixels where it is determined that all the sample areas of that pixel are located within that primitive, a value is stored in a multisample memory for a smaller number of the sample areas of that pixel than the total number of the sample areas of that pixel and data is stored indicating that all the sample areas of that pixel are located within that primitive.
Opening claim text (preview).
What is claimed is: 1. A method for processing a plurality of sample points of a computer graphics image, the method comprising: processing a primitive, by: comparing, when not all the sample points are located within said primitive, the sample points located within the primitive with sample points of the plurality of sample points in which a previous primitive value is stored, wherein at least one of the sample points located within the primitive is also located within the previous primitive; and writing to a memory, when the only sample points not located within the primitive are sample points for which the value of the previous primitive has been stored, a value of the primitive for each sample point located within the primitive for which the value of the previous primitive is not stored. 2. The method according to claim 1 , wherein the previous primitive is processed, by: storing in the memory, when all the sample points are located within said previous primitive, a value for the previous primitive for a smaller number of the sample points than the total number of the sample points, and storing data indicating that all the sample points are located within the previous primitive. 3. The method according to claim 2 , wherein the smaller number of the sample points is one. 4. The method according to claim 2 , wherein the data indicating that all the sample points are located within the previous primitive comprises a flag. 5. The method according to claim 4 , wherein the flag comprises a single bit. 6. The method according to claim 1 , wherein the value for the previous primitive and the value for the primitive comprises a colour value. 7. An apparatus for processing a plurality of sample points of a computer graphics image, the apparatus comprising: a memory; and a processor unit configured to process a primitive, by: comparing, when not all the sample points are located within said primitive, the sample points located within the primitive with sample points of the plurality of sample points in which a previous primitive value is stored, wherein at least one of the sample points located within the primitive is also located within the previous primitive; and writing to the memory, when the only sample points not located within the primitive are sample points for which the value of the previous primitive has been stored, the value of the primitive for each sample point located within the primitive for which the value of the previous primitive is not stored. 8. The apparatus according to claim 7 , wherein the processor unit is configured to process the previous primitive by: storing in the memory, when all the sample points are located within said previous primitive, a value for the previous primitive for a smaller number of the sample points than the total number of the sample points, and storing data indicating that all the sample points are located within the previous primitive. 9. The apparatus according to claim 8 , wherein the smaller number of the sample points is one. 10. The apparatus according to claim 8 , wherein the data indicating that all the sample points are located within the previous primitive comprises a flag. 11. The apparatus according to claim 10 , wherein the flag comprises a single bit. 12. The apparatus according to claim 7 , wherein the processor unit comprises one or more programmable processors. 13. The apparatus according to claim 7 , wherein the processor unit comprises an input processor, an output processor and a multisample processor. 14. The apparatus according to claim 7 , wherein the value for the previous primitive and the value for the primitive comprises a colour value. 15. A method for processing a plurality of sample points of a computer graphics image, the method comprising: processing a primitive by: determining whether all sample points are located within a previous primitive, the value of which is stored in a memory for less than all sample points; determining whether all sample points are located within the primitive; if it is determined that all sample points are located within said previous primitive and that not all sample points are located within the primitive, determining whether the only sample point not located within the primitive corresponds to a sample point having a value stored for said previous primitive; and if it is determined that the only sample point not located within the primitive corresponds to a sample point having a stored value for said previous primitive, storing in the memory the value of said primitive in all sample points for which the value of the previous primitive is not stored.
involving antialiasing · CPC title
General purpose rendering architectures · CPC title
Filling planar surfaces by adding surface attributes, e.g. adding colours or textures · CPC title
Blending, e.g. for anti-aliasing · CPC title
Memory management · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.