# US 2014/0198120 A1 · Reducing the Domain Shader/Tessellatorinvocations

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

- Number: US 2014/0198120 A1
- Document ID: US20140198120A1
- Status: Published application
- Kind: A1
- Application number: 13/992,966
- Filed: 2011-12-30
- Published: 2014-07-17
- Earliest claimed: 2011-12-30
- Assignees: Intel Corporation
- Inventors: Rahul P. Sathe; Tim Foley
- Web page: https://patentgrep.com/patent/US20140198120A1

## CPC

- G06T 15/005: {General purpose rendering architectures}
- G06T 1/60: Memory management
- G06T 17/20: Finite element generation, e.g. wire-frame surface description, {tesselation}
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

In accordance with some embodiments, domain shader and/or tessellator operations can be eliminated when they are redundant. By using a corner cache, a check can determine whether a given corner, be it a vertex or a quadrilateral corner, has already been evaluated in the domain shader and/or tessellator and if so, the result of the previous operation can be reused instead of performing unnecessary invocations that may increase power consumption or reduce speed.

## Claims

### Claim 1

A method comprising:
domain shading a first corner of a first patch; and
domain shading a corner of a second patch only if that corner is not the first corner.

### Claim 2 (depends on 1)

The method of claim 1 including providing a unique identifier for each corner of a patch.

### Claim 3 (depends on 2)

The method of claim 2 including using an identifier to determine whether a corner has already been domain shaded.

### Claim 4 (depends on 3)

The method of claim 3 including storing an indication of which corners have already been domain shaded in a cache.

### Claim 5 (depends on 1)

The method of claim 1 including determining whether an edge and a patch have already been domain shaded.

### Claim 6 (depends on 5)

The method of claim 5 including, if an edge has already been domain shaded, skipping the domain shading for that edge in a subsequent patch.

### Claim 7 (depends on 6)

The method of claim 6 including using one cache to store edges and corners already domain shaded and analyzing all the corners and edges of a patch at one time.

### Claim 8 (depends on 1)

The method of claim 1 including hull shading a given patch by adding a new corner to said patch.

### Claim 9 (depends on 8)

The method of claim 8 including forming a new corner in the center of a patch and defining a set of four triangles each having the same corner within said patch.

### Claim 10 (depends on 9)

The method of claim 9 including automatically determining a unique identifier for said new corner.

### Claim 11

A non-transitory computer readable medium storing instructions to enable a processor to perform a method comprising:
domain shading a first corner of a first patch; and
domain shading a corner of a second patch only if that corner is not the first corner.

### Claim 12 (depends on 11)

The medium of claim 11 including providing a unique identifier for each corner of a patch.

### Claim 13 (depends on 12)

The medium of claim 12 including using an identifier to determine whether a corner has already been domain shaded.

### Claim 14 (depends on 13)

The medium of claim 13 including storing an indication of which corners have already been domain shaded in a cache.

### Claim 15 (depends on 11)

The medium of claim 11 including determining whether an edge and a patch have already been domain shaded.

### Claim 16 (depends on 15)

The medium of claim 15 including, if an edge has already been domain shaded, skipping the domain shading for that edge in a subsequent patch.

### Claim 17 (depends on 16)

The medium of claim 16 including using one cache to store edges and corners already domain shaded and analyzing all the corners and edges of a patch at one time.

### Claim 18 (depends on 11)

The medium of claim 11 including hull shading a given patch by adding a new corner to said patch.

### Claim 19 (depends on 18)

The medium of claim 18 including forming a new corner in the center of a patch and defining a set of four triangles each having the same corner within said patch.

### Claim 20 (depends on 19)

The medium of claim 19 including automatically determining a unique identifier for said new corner.

### Claim 21

An apparatus comprising:
a processor to domain shade a first corner of a first patch and to domain shade a corner of a second patch only if that corner is not the first corner; and
a memory complied to said processor.

### Claim 22 (depends on 21)

The apparatus of claim 21, said processor to provide a unique identifier for each corner of a patch.

### Claim 23 (depends on 22)

The apparatus of claim 22, said processor to use an identifier to determine whether a corner has already been domain shaded.

### Claim 24 (depends on 23)

The apparatus of claim 23, said processor to store an indication of which corners have already been domain shaded in a cache.

### Claim 25 (depends on 21)

The apparatus of claim 21, said processor to determine whether an edge and a patch have already been domain shaded.

### Claim 26 (depends on 25)

The apparatus of claim 25, said processor to, if an edge has already been domain shaded, skip the domain shading for that edge in a subsequent patch.

### Claim 27 (depends on 26)

The apparatus of claim 26, said processor to use one cache to store edges and corners already domain shaded and analyze all the corners and edges of a patch at one time.

### Claim 28 (depends on 21)

The apparatus of claim 21, said processor to hull shade a given patch by adding a new corner to said patch.

### Claim 29 (depends on 28)

The apparatus of claim 28, said processor to form a new corner in the center of a patch and define a set of four triangles each having the same corner within said patch.

### Claim 30 (depends on 29)

The apparatus of claim 29, said processor to automatically determine a unique identifier for said new corner.
