# US 2017/0256079 A1 · Selective Rasterization

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

- Number: US 2017/0256079 A1
- Document ID: US20170256079A1
- Status: Published application
- Kind: A1
- Application number: 15/492,112
- Filed: 2017-04-20
- Published: 2017-09-07
- Earliest claimed: 2013-10-07
- Assignees: Intel Corporation
- Applicants: Intel Corporation
- Inventors: Tomas G. Akenine-Moller; Carl J. Munkberg; Franz P. Clarberg
- Web page: https://patentgrep.com/patent/US20170256079A1

## CPC

- G06T 11/40: Filling planar surfaces by adding surface attributes, e.g. adding colours or textures
- G01R 19/0092: {Measuring current only}
- H02J 7/00: Circuit arrangements for charging or discharging batteries or for supplying loads from batteries
- H02J 2207/40: adapted for charging from various sources, e.g. AC, DC or multivoltage
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G01R: MEASURING ELECTRIC VARIABLES; MEASURING MAGNETIC VARIABLES (indicating correct tuning of resonant circuits H03J3/12)
- H02J: ELECTRIC POWER NETWORKS; CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY

## Abstract

According to one embodiment, a given tile, made up of pixels or samples, may be of any shape, including a square shape. These pixels may contain colors, depths, stencil values, and other values. Each tile may be further augmented with a single bit, referred to herein as a render bit. In one embodiment, if the render bit is one, then everything is rendered as usual within the tile. However, if the render bit is zero, then nothing is rasterized to this tile and, correspondingly, depth tests, pixel shading, frame buffer accesses, and multi-sampled anti-aliasing (MSAA) resolves are not done for this tile. In other embodiments, some operations may be done nevertheless, but at least one operation is avoided based on the render bit. Of course, the render bits may be switched such that the bit zero indicates that everything should be rendered and the bit one indicates more limited rendering.

## Claims

### Claim at position 1

1-30. (canceled)

### Claim 31

A graphics processing unit comprising:
first circuitry to:
organize pixels, generated in response to execution in a draw call, into tiles;
determine whether a first tile processed after a second tile matches a characteristic of the second tile;
set a bit to indicate if characteristics of the first and second tiles match;
if the first tile matches the second tile based on the bit, forego rendering for the first tile;
if the first tile does not match the prior second tile, based on the bit, render the first tile; and
second circuitry to determine a hash for a third tile and a fourth tile, and if said hashes match, reduce processing of one of said third and fourth tiles.

### Claim 32 (depends on 31)

The graphics processing unit of claim 31 said unit to receive a draw call and to set said bit based on said draw call.

### Claim 33 (depends on 31)

The graphics processing unit of claim 31 said unit to set a single bit for each tile.

### Claim 34 (depends on 31)

The graphics processing unit of claim 31 said unit to calculate a value for each tile based on data values that represent each tile.

### Claim 35

A system comprising:
a graphics processing unit to:
organize pixels, generated in response to execution in a draw call into tiles;
determine whether a first tile processed after a second tile matches a characteristic of the second tile;
set a bit to indicate if characteristics of the first and second tiles match;
if the first tile matches the second tile based on the bit, forego rendering for the first tile;
if the first tile does not match the prior second tile, based on the bit, render the first tile;
determine a hash for a third tile and a fourth tile, and if said hashes match, reduce processing of one of said third and fourth tiles; and
a storage coupled to said graphics processing unit.

### Claim 36 (depends on 35)

The system of claim 35 said unit to receive a draw call and to set said bit based on said draw call.

### Claim 37 (depends on 35)

The system of claim 35 said unit to set a single bit for each tile.

### Claim 38 (depends on 35)

The system of claim 35 said unit to calculate a value for each tile based on data values that represent each tile.

### Claim 39 (depends on 35)

The system of claim 35 including a memory controller.

### Claim 40 (depends on 35)

The system of claim 35 including a central processing unit.

### Claim 41 (depends on 35)

The system of claim 35 including a display.

### Claim 42 (depends on 35)

The system of claim 35 including a modem.

### Claim 43

A method comprising:
organizing pixels, generated in response to execution in a draw call, into tiles;
determining whether a first tile processed after a second tile matches a characteristic of the second tile;
setting a bit to indicate if characteristics of the first and second tiles match;
if the first tile matches the second tile based on the bit, foregoing rendering for the first tile;
if the first tile does not match the prior second tile, based on the bit, rendering the first tile;
and
determining a hash for a third tile and a fourth tile, and if said hashes match, reduce processing of one of said third and fourth tiles.

### Claim 44 (depends on 43)

The method of claim 43 including receiving a draw call and to set said bit based on said draw call.

### Claim 45 (depends on 43)

The method of claim 43 including setting a single bit for each tile.

### Claim 46

The method of 43 including calculating a value for each tile based on data values that represent each tile.

### Claim 47

One or more non-transitory computer readable media storing instructions to perform a sequence comprising:
organizing pixels, generated in response to execution in a draw call, into tiles;
determining whether a first tile processed after a second tile matches a characteristic of the second tile;
setting a bit to indicate if characteristics of the first and second tiles match;
if the first tile matches the second tile based on the bit, foregoing rendering for the first tile;
if the first tile does not match the prior second tile, based on the bit, rendering the first tile; and
determining a hash for a third tile and a fourth tile, and if said hashes match, reduce processing of one of said third and fourth tiles.

### Claim 48 (depends on 47)

The media of claim 47, further storing instructions to perform a sequence including receiving a draw call and to set said bit based on said draw call.

### Claim 49 (depends on 47)

The media of claim 47 including setting a single bit for each tile.

### Claim 50

The method of 47 including calculating a value for each tile based on data values that represent each tile.
