# US 2010/0164954 A1 · Tessellator Whose Tessellation Time Grows Linearly with the Amount of Tessellation

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

- Number: US 2010/0164954 A1
- Document ID: US20100164954A1
- Status: Published application
- Kind: A1
- Application number: 12/347,114
- Filed: 2008-12-31
- Published: 2010-07-01
- Earliest claimed: 2008-12-31
- Inventors: Rahul P. Sathe; Paul A. Rosen
- Web page: https://patentgrep.com/patent/US20100164954A1

## CPC

- G06T 17/20: Finite element generation, e.g. wire-frame surface description, {tesselation}
- H04N 19/29: involving scalability at the object level, e.g. video object layer [VOL]
- H04N 19/36: Scalability techniques involving formatting the layers as a function of picture distortion after decoding, e.g. signal-to-noise [SNR] scalability
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- H04N: PICTORIAL COMMUNICATION, e.g. TELEVISION

## Abstract

In accordance with some embodiments, a tessellator may experience only a linear increase in tessellation time with increasing edge levels of detail. Conventionally, tessellators experience a non-linear or quadratic increase in tessellation time with increasing levels of detail. In some embodiments, the intervals and the triangulation of the inner tessellation may be pre-computed. Then at run time, the pre-computed values may be looked up for the applicable edge level of detail.

## Claims

### Claim 1

A method comprising:
performing a tessellation whose tessellation time increases linearly with increasing tessellation level of detail.

### Claim 2 (depends on 1)

The method of claim 1 including using a software tessellator.

### Claim 3 (depends on 1)

The method of claim 1 including pre-computing inner tessellation values for a plurality of different edge levels of detail before run time.

### Claim 4 (depends on 3)

The method of claim 3 including looking up the pre-computed inner tessellation values at run time.

### Claim 5 (depends on 4)

The method of claim 4 including pre-computing the triangulation of the inner tessellation.

### Claim 6 (depends on 1)

The method of claim 1 including using 1-axis inner tessellation factor axis reduction.

### Claim 7 (depends on 1)

The method of claim 1 including using a quad as the primitive domain for the tessellation.

### Claim 8 (depends on 1)

The method of claim 1 including sorting and grouping patches with the same edge level of detail on separate physical cores.

### Claim 9 (depends on 8)

The method of claim 8 including threading and vectorizing.

### Claim 10

An apparatus comprising:
a hull shader; and
a tessellator coupled to said hull shader to form a tessellation whose tessellation time increase linearly with increasing tessellation level of detail.

### Claim 11 (depends on 10)

The apparatus of claim 10 wherein tessellator is a software tessellator.

### Claim 12 (depends on 10)

The apparatus of claim 10 wherein said tessellator to pre-compute inner tessellation values for a plurality of different edge levels of detail before run time.

### Claim 13 (depends on 12)

The apparatus of claim 12, said tessellator to look up the pre-computed inner tessellation values at run time.

### Claim 14 (depends on 13)

The apparatus of claim 13, said tessellator to pre-compute the triangulation of the inner tessellation.

### Claim 15 (depends on 10)

The apparatus of claim 10, said tessellator to use 1-axis inner tessellation factor axis reduction.

### Claim 16 (depends on 10)

The apparatus of claim 10, said tessellator to use as a primitive domain a quad.

### Claim 17 (depends on 10)

The apparatus of claim 10, said tessellator to sort in group patches with the same edge level of detail on separate physical cores of a multi-core processor.

### Claim 18 (depends on 17)

The apparatus of claim 17, said tessellator to use threading and vectorizing.

### Claim 19

A system comprising:
a multi-core processor including at least two cores, each of said cores including a first and second buffer;
a patch sorter to sort patches for tessellation based on their edge level of detail and to provide the patches having the same level of detail to the same core; and
a tessellator to tessellate said patches by pre-computing the intervals and triangulation for the inner tessellations and applying the pre-computed intervals and triangulations during run time using a look up technique.

### Claim 20 (depends on 19)

The system of claim 19 using threading and vectorizing.

### Claim 21 (depends on 19)

The system of claim 19, said system to perform tessellations where the tessellation time increases linearly with increasing tessellation level of detail.

### Claim 22 (depends on 10)

The system of claim 10 including a software tessellator.
