# US 2010/0164969 A1 · Methods and systems to selectively batch-cull graphics primitives in response to sample cull results

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

- Number: US 2010/0164969 A1
- Document ID: US20100164969A1
- Status: Published application
- Kind: A1
- Application number: 12/347,557
- Filed: 2008-12-31
- Published: 2010-07-01
- Earliest claimed: 2008-12-31
- Assignees: Intel Corporation
- Inventors: Uzi Sarel; Arie Narkis
- Web page: https://patentgrep.com/patent/US20100164969A1

## CPC

- G06T 15/40: Hidden part removal
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

Methods and systems to sample a subset of primitives from a batch of primitives for cull/no-cull decisions, and to selectively perform a batch-cull operation on the batch of primitives in response to cull/no-cull decisions of the samples. Cull/no-cull decisions may be determined in response to one or more of a sign and magnitude of a z-component of a surface normal to corresponding primitives, using one or more primitive-independent, vertex-based cull codes, which may include a cull code based on 2-dimensional pixel space positions corresponding to the primitives. 2-dimensional pixel space positions may be pre-computed for vertices associated with a batch of primitives in advance of sampling culling.

## Claims

### Claim 1

A method, comprising:
computing 2-dimensional pixel space positions of vertices associated with a batch of graphics primitives;
performing a sample culling operation on a sample set of the graphics primitives using the corresponding 2-dimensional pixel space positions; and
selectively determining to perform a batch culling operation on the batch of graphics primitives in response to results of the sample culling operation.

### Claim 2 (depends on 1)

The method of claim 1, wherein the selectively determining includes:
determining to perform the batch culling operation on the batch of graphics primitives when the sample culling operation results in a cull decision with respect to at least a threshold number of graphics primitives of the sample set of graphics primitives; and
associating a no-cull decision with the batch of graphics primitives when the sample culling operation results in a cull decision with respect to less than the threshold number of graphics primitives of the sample set of graphics primitives.

### Claim 3 (depends on 2)

The method of claim 2, wherein the associating a no-cull decision with the batch of graphics primitives includes bypassing the batch culling operation with respect to the batch of graphics primitives.

### Claim 4 (depends on 2)

The method of claim 2, further comprising, performing the batch culling operation in response to the determining, using the corresponding 2-dimensional vertex pixel space positions.

### Claim 5 (depends on 2)

The method of claim 2, further comprising, performing the batch culling operation only on graphics primitives of the batch of graphics primitives that are not part of the sample set.

### Claim 6 (depends on 1)

The method of claim 1, wherein the performing the sample culling operation includes:
determining a z-component of a surface normal for graphics primitives of the sample set of graphics primitives from the corresponding 2-dimensional vertex pixel space positions; and
associating a cull decision with a graphics primitive based at least in part on the corresponding z-component.

### Claim 7 (depends on 6)

The method of claim 6, wherein the associating includes:
associating a cull decision with the graphics primitive when a sign of the z-component corresponds to a back-facing primitive.

### Claim 8 (depends on 6)

The method of claim 6, wherein the associating includes:
associating a cull decision with a graphics primitive when a magnitude of the z-component corresponds to zero area.

### Claim 9 (depends on 6)

The method of claim 6, wherein the determining the z-component includes:
determining the z-component in accordance with ((V2−V0)X(V1−V0),
where V0, V1, and V2 represent the 2-dimensional vertex pixel space positions of a corresponding graphics primitive.

### Claim 11 (depends on 10)

The method of claim 10, wherein the associating includes:
associating a cull decision with graphics primitives when a sign of the z-component corresponds to a back-facing primitive; and
associating a cull decision with graphics primitives when a magnitude of the z-component corresponds to zero area.

### Claim 12

A computer program product comprising a computer readable medium having computer program logic stored therein to cause a processor to perform operations in response thereto, the computer program logic including:
cull code logic to cause the processor to compute cull/no-cull decisions for graphics primitives from corresponding 2-dimensional vertex pixel space positions of the graphics primitives;
sample logic to cause the processor to invoke the cull code logic with respect to a sample set of graphics primitives from a batch of graphics primitives; and
decision logic to cause the processor to invoke the cull code logic with respect to the batch of primitives when the cull code logic generates a cull decision with respect to at least a threshold number of graphics primitives within the sample set of graphics primitives, and to associate a no-cull decision with the batch of primitives when the cull code logic generates a cull decision with respect to less than the threshold number of graphics primitives within the sample set of primitives.

### Claim 13 (depends on 12)

The computer program product of claim 12, wherein the computer program logic further includes:
vertex coordinate logic to cause the processor to compute the 2-dimensional vertex pixel space positions.

### Claim 14 (depends on 12)

The computer program product of claim 12, wherein the computer program logic further includes:
vertex coordinate logic to cause the processor to compute the 2-dimensional vertex pixel space positions prior to invoking of the sample logic and the cull code logic.

### Claim 15 (depends on 12)

The computer program product of claim 12, wherein the cull code logic includes:
surface normal logic to cause the processor to determine a z-component of a surface normal corresponding to the graphics primitives; and
associate logic to cause the processor to associate a cull decision with graphics primitives based at least in part on the corresponding z-component.

### Claim 16 (depends on 15)

The computer program product of claim 15, wherein the surface normal logic includes:
logic to cause the processor to determine the z-component in accordance with (V2−V0)X(V1−V0),
where V0, V1, and V2 represent the 2-dimensional vertex pixel space positions of a corresponding graphics primitive.

### Claim 17

A system, comprising:
a processor; and
a computer program product including a computer readable medium having computer program logic stored therein to cause the processor to perform operations in response thereto, the computer program logic including;
cull code logic to cause the processor to compute cull/no-cull decisions for graphics primitives from corresponding 2-dimensional vertex pixel space positions of the graphics primitives,
sample logic to cause the processor to invoke the cull code logic with respect to a sample set of graphics primitives from a batch of graphics primitives, and
decision logic to cause the processor to invoke the cull code logic with respect to the batch of graphics primitives when the cull code logic generates a cull decision with respect to at least a threshold number of graphics primitives within the sample set of graphics primitives, and to associate a no-cull decision with the batch of graphics primitives when the cull code logic generates a cull decision with respect to less than the threshold number of graphics primitives within the sample set of graphics primitives.

### Claim 18 (depends on 17)

The system according to claim 17, further comprising vertex coordinate logic to compute the 2-dimensional vertex pixel space positions, wherein:
the processor includes a graphics processor and corresponding graphics memory;
the vertex coordinate logic includes logic to store the 2-dimensional vertex pixel space positions in the system memory; and
the cull code logic includes logic to cause the graphics processor to compute cull/no-cull decisions for a plurality of the graphics primitives in parallel from the corresponding 2-dimensional pixel space positions, and to store the cull/no-cull decisions in the graphics memory.

### Claim 19 (depends on 18)

The system according to claim 18, wherein the vertex coordinate logic includes computer program logic.

### Claim 20 (depends on 18)

The system according to claim 18, wherein the vertex coordinate logic includes integrated circuit logic.
