# US 2015/0084981 A1 · Anti-Aliasing for Graphics Hardware

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0084981 A1
- Document ID: US20150084981A1
- Status: Published application
- Kind: A1
- Application number: 14/037,635
- Filed: 2013-09-26
- Published: 2015-03-26
- Earliest claimed: 2013-09-26
- Assignees: Intel Corporation
- Inventors: Franz P. Clarberg
- Web page: https://patentgrep.com/patent/US20150084981A1

## CPC

- G06T 11/40: Filling planar surfaces by adding surface attributes, e.g. adding colours or textures
- G06T 2200/12: involving antialiasing
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

Visibility may be analytically resolved rather than using point-sampling, thereby entirely avoiding geometric aliasing and the need to store multiple samples per pixel. By relying on existing techniques for shading, i.e., by shading once per fragment and focusing on visibility, visual results may be equivalent to multi-sampled anti-aliasing (MSAA) using an infinite sampling rate in some embodiments.

## Claims

### Claim 1

A method comprising:
finding pixels that in any part overlap a triangle;
passing fragments to a buffer; and
resolving visibility between multiple fragments.

### Claim 2 (depends on 1)

The method of claim 1 including performing outer conservative rasterization.

### Claim 3 (depends on 1)

The method of claim 1 including performing inner conservative rasterization.

### Claim 4 (depends on 1)

The method of claim 1 including running all rendering passes at one sample per pixel.

### Claim 5 (depends on 1)

The method of claim 1 including resolving visibility by performing micro-rasterization.

### Claim 6 (depends on 2)

The method of claim 2 including analytically resolving visibility between multiple fragments.

### Claim 7 (depends on 3)

The method of claim 3 including performing anti-aliasing at all edges and triangle intersections.

### Claim 8 (depends on 3)

The method of claim 3 including performing anti-aliasing only at visible discontinuity edges.

### Claim 9 (depends on 3)

The method of claim 3 including determining per pixel fragment counts.

### Claim 10 (depends on 9)

The method of claim 9 including, for all fragments passing a depth test, passing a fragment to a buffer if the fragment count for a pixel is larger than one or if the fragment is partially covered.

### Claim 11

At least one non-transitory computer readable medium storing instructions executed by a processor to perform a sequence comprising:
finding pixels that in any part overlap a triangle;
passing fragments to a buffer; and
resolving visibility between multiple fragments.

### Claim 12 (depends on 11)

The medium of claim 11, said sequence including performing outer conservative rasterization.

### Claim 13 (depends on 11)

The medium of claim 11, said sequence including performing inner conservative rasterization.

### Claim 14 (depends on 11)

The medium of claim 11, said sequence including running all rendering passes at one sample per pixel.

### Claim 15 (depends on 11)

The medium of claim 11, said sequence including resolving visibility by performing micro-rasterization.

### Claim 16 (depends on 12)

The medium of claim 12, said sequence including analytically resolving visibility between multiple fragments.

### Claim 17 (depends on 13)

The medium of claim 13, said sequence including performing anti-aliasing at all edges and triangle intersections.

### Claim 18 (depends on 13)

The medium of claim 13, said sequence including performing anti-aliasing only at visible discontinuity edges.

### Claim 19 (depends on 13)

The medium of claim 13, said sequence including determining per pixel fragment counts.

### Claim 20 (depends on 19)

The medium of claim 19, said sequence including, for fragments passing a depth test, passing a fragment to a buffer if the fragment count for a pixel is larger than one or if the fragment is partially covered.

### Claim 21

An apparatus comprising:
a processor to find pixels that in any part overlap a triangle, pass fragments to a buffer, and resolve visibility between multiple fragments; and
a storage coupled to said processor.

### Claim 22 (depends on 21)

The apparatus of claim 21, said processor to perform outer conservative rasterization.

### Claim 23 (depends on 21)

The apparatus of claim 21, said processor to perform inner conservative rasterization.

### Claim 24 (depends on 21)

The apparatus of claim 21, said processor to run all rendering passes at one sample per pixel.

### Claim 25 (depends on 21)

The apparatus of claim 21, said processor to resolve visibility by performing micro-rasterization.

### Claim 26 (depends on 22)

The apparatus of claim 22, said processor to analytically resolve visibility between multiple fragments.

### Claim 27 (depends on 23)

The apparatus of claim 23, said processor to perform anti-aliasing at all edges and triangle intersections.

### Claim 28 (depends on 21)

The apparatus of claim 21 including an operating system.

### Claim 29 (depends on 21)

The apparatus of claim 21 including a battery.

### Claim 30 (depends on 21)

The apparatus of claim 21 including firmware and a module to update said firmware.
