# US 2010/0164955 A1 · Image forming techniques

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

- Number: US 2010/0164955 A1
- Document ID: US20100164955A1
- Status: Published application
- Kind: A1
- Application number: 12/387,187
- Filed: 2009-04-29
- Published: 2010-07-01
- Earliest claimed: 2008-12-31
- Assignees: Intel Corporation
- Inventors: Rahul P. Sathe; Paul A. Rosen
- Web page: https://patentgrep.com/patent/US20100164955A1

## CPC

- G06T 17/20: Finite element generation, e.g. wire-frame surface description, {tesselation}
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

In some embodiments, the intervals and the triangulation of an inner tessellation of a patch may be pre-computed. Even factor tessellations are arranged in a co-centric manner so that lower number factors are inside tessellations with higher number factors. Similarly, odd factor tessellations are arranged in a co-centric manner so that lower number factors are inside tessellations with higher number factors. Domain points of even factor tessellations are stored in a first table whereas domain points of odd factor tessellations are stored in a second table. At run time, the pre-computed values may be looked up for the applicable edge level of detail.

## Claims

### Claim 1

A computer-implemented method comprising:
generating a tessellation based on stored domain points, wherein the generating comprises:
retrieving domain points of an inner tessellation from one of an even or odd factor tessellation table; and
providing the tessellation for display.

### Claim 2 (depends on 1)

The method of claim 1, wherein the generating further comprises:
converting the domain points to the [0,1] domain.

### Claim 3 (depends on 2)

The method of claim 2, wherein the converting comprises:
converting the domain points from signed integer format to floating point format.

### Claim 4 (depends on 1)

The method of claim 1, wherein the retrieving comprises:
retrieving domain points in an order commencing from an inner most domain point of the tessellation to an outer domain point in a spiral-like order.

### Claim 5 (depends on 1)

The method of claim 1, wherein the generating further comprises:
reading indexes of corner points of triangles from an index buffer.

### Claim 6 (depends on 1)

The method of claim 1, wherein the generating further comprises:
generating domain points along outer edges of the tessellation.

### Claim 7 (depends on 1)

The method of claim 1, further comprising:
arranging at least lower factor tessellation within at least one higher factor tessellation; and
storing the arranged tessellation in an order commencing from an inner most domain point of the arranged tessellation to an outer domain point in a spiral-like manner.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
storing indexes of triangle corners in an index buffer, wherein indexes of corners are associated with domain points.

### Claim 9 (depends on 1)

The method of claim 1, wherein the tessellation comprises at least one of a quad or a triangle.

### Claim 10

A computer-readable medium that stores instructions, which when executed by a computer, cause the computer to:
generate a patch based on stored domain points, wherein to generate, the computer is to:
retrieve encoded domain points of an inner tessellation of the patch from one of an even or odd factor tessellation table,
convert encoded domain points to the [0,1] domain, and
retrieve indexes of triangle corners; and
provide the patch for display.

### Claim 11 (depends on 10)

The computer-readable medium of claim 10, wherein to convert encoded domain points to the [0,1] domain, the computer is to scale and bias the encoded domain points.

### Claim 12 (depends on 10)

The computer-readable medium of claim 10, wherein to retrieve encoded domain points, the computer is to:
retrieve encoded domain points in an order commencing from an inner most encoded domain point of the tessellation to an outer domain point in a spiral-like manner.

### Claim 13 (depends on 10)

The computer-readable medium of claim 10, wherein the encoded domain points are stored in an arrangement of at least one lower factor tessellation within at least one higher factor tessellation.

### Claim 14 (depends on 10)

The computer-readable medium of claim 10, wherein to generate a patch, the computer is to generate domain points along outer edges of the patch.

### Claim 15 (depends on 10)

The computer-readable medium of claim 10, wherein to retrieve indexes of triangle corners, the computer is to retrieve indexes from either a table of even or odd levels of detail.

### Claim 16

An apparatus comprising:
a tessellator to generate a patch, wherein to generate a patch, the tessellator is to retrieve domain points of a patch, wherein to retrieve domain points, the tessellator is to retrieve domain points of an inner tessellation from one of an odd or even table; and
a domain shader to convert domain points to [0,1] domain and to generate a three dimensional point on the patch.

### Claim 17 (depends on 16)

The apparatus of claim 16, wherein to convert domain points to the [0,1] domain, the domain shader is to scale and bias the encoded domain points.

### Claim 18 (depends on 16)

The apparatus of claim 16, wherein to retrieve domain points, the tessellator is to:
retrieve domain points in an order commencing from an inner most domain point of the inner tessellation to an outer domain point of the inner tessellation in a spiral-like manner.

### Claim 19 (depends on 16)

The apparatus of claim 16, wherein the domain points are stored in an arrangement of at least one lower factor tessellation within at least one higher factor tessellation.

### Claim 20 (depends on 16)

The apparatus of claim 16, wherein to generate a patch, the tessellator is to generate domain points along outer edges of the patch.

### Claim 21 (depends on 16)

The apparatus of claim 16, wherein to generate the patch, the tessellator is also to retrieve indexes of triangle corners from a table of odd or even levels of details.

### Claim 22

A system comprising:
a display; and
a computing system to generate patches to transmit to the display, wherein the computing system comprises:
a tessellator to generate a patch, wherein to generate a patch, the tessellator is to retrieve domain points of a patch, wherein to retrieve domain points, the tessellator is to retrieve domain points of an inner tessellation from one of an odd or even table; and
a domain shader to convert domain points to a [0,1] domain and to generate a three dimensional point on the patch.

### Claim 23 (depends on 22)

The system of claim 22, wherein to convert domain points to the [0,1] domain, the domain shader is to scale and bias the encoded domain points.

### Claim 24 (depends on 22)

The system of claim 22, wherein to retrieve domain points, the tessellator is to:
retrieve domain points in an order commencing from an inner most domain point of the inner tessellation to an outer domain point of the inner tessellation in a spiral-like manner.

### Claim 25 (depends on 22)

The system of claim 22, wherein to generate the patch, the tessellator is also to retrieve indexes of triangle corners from either a table or odd or even levels of details.
