# US 2015/0145863 A1 · Method for rendering an image synthesis and corresponding device

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

- Number: US 2015/0145863 A1
- Document ID: US20150145863A1
- Status: Published application
- Kind: A1
- Application number: 14/370,778
- Filed: 2012-11-08
- Published: 2015-05-28
- Earliest claimed: 2012-01-10
- Assignees: Thomson Licensing
- Applicants: Thomson Licensing
- Inventors: Cyprien Buron; Jean-Eudes Marvie; Pascal Gautron
- Web page: https://patentgrep.com/patent/US20150145863A1

## CPC

- G06T 17/205: {Re-meshing}
- G06T 15/005: {General purpose rendering architectures}
- G06T 15/10: Geometric effects
- G06T 17/005: {Tree description, e.g. octree, quadtree}
- G06T 17/20: Finite element generation, e.g. wire-frame surface description, {tesselation}
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

A method and device for rendering a synthesis image comprising generating a plurality of elementary geometries (201 . . . 2i2) from an input geometry, a plurality of vertices being associated with each elementary geometry, each vertex being defined with coordinates; assigning an index value (0, 1 . . . 6, 7) to each elementary geometry of at least a part of the elementary geometries (201 . . . 2i2), the index value being estimated from the coordinates associated with at least one vertex of the elementary geometry, and rendering the synthesis image by using the indexed elementary geometries.

## Claims

### Claim 1

A method of rendering a computer graphic image, comprising:
generating a plurality of elementary geometries from an input geometry, a plurality of vertices being associated with each elementary geometry, each vertex being defined with coordinates,
assigning an index value to each elementary geometry of at least a part of the elementary geometries, the index value being computed from the coordinates associated with at least one vertex of the elementary geometry, and
rendering the computer graphic image by using the indexed elementary geometries.

### Claim 2 (depends on 1)

The method according to claim 1 further comprising determining a number of elementary geometries to be generated.

### Claim 3 (depends on 2)

The method according to claim 2, wherein the computer graphic image is generated from a grammar comprising at least a procedural rule and a set of rule parameters, the determining of the number of elementary geometries comprising:
representing the grammar with a tree, the tree being representative of the at least a procedural rule,
determining a number of terminal symbols by parsing the tree representative of the at least a procedural rule according to the set of rule parameters,
the number of elementary geometries to be generated corresponding to the determined number of terminal symbols.

### Claim 4 (depends on 3)

The method according to claim 3, further comprising assigning one single indexed elementary geometry to each terminal symbol.

### Claim 5 (depends on 3)

The method according to claim 3, wherein the computer graphic image is rendered from the grammar.

### Claim 6 (depends on 1)

The method according to claim 1, wherein the elementary geometries correspond to triangles, the triangles being obtained from quadrilaterals subdivided into two triangles, each quadrilateral comprising a lower triangle and an upper triangle, the assigning of the index value comprising the following steps, implemented for each elementary geometry of the at least a part of the elementary geometries:
determining the minimal coordinates (xmin, ymin) of the elementary geometry, xmin and ymin being normalized between 0 and 1,
determining if the elementary geometry is an upper triangle or a lower triangle,
determining the index value to be assigned to the elementary geometry, the index value being equal to:
i.xmin+2.i.j.ymin, if the elementary geometry is a lower triangle, or
i


x
min
+
2

ij

(
y
min
+
1
2

j
)
,
if the elementary geometry is an upper triangle,
wherein i×j corresponds to the number of quadrilaterals.

### Claim 7 (depends on 1)

The method according to claim 1, wherein the assigning of the index value is implemented in a geometry shader of a graphics hardware pipeline.

### Claim 8

A device configured for rendering a computer graphic image, wherein the device comprises at least a processor configured for:
generating a plurality of elementary geometries from an input geometry, a plurality of vertices being associated with each elementary geometry, each vertex being defined with coordinates,
assigning an index value to each elementary geometry of at least a part of the elementary geometries, the index value being computed from the coordinates associated with at least one vertex of the elementary geometry, and
rendering the computer graphic image by using the indexed elementary geometries.

### Claim 9 (depends on 8)

The device according to claim 8, wherein the at least a processor is further configured for determining a number of elementary geometries to be generated.

### Claim 10 (depends on 9)

The device according to claim 9, wherein the computer graphic image is generated from a grammar comprising at least a procedural rule and a set of rule parameters, the at least a processor being further configured for:
representing the grammar with a tree, the tree being representative of the at least a procedural rule,
determining a number of terminal symbols by parsing the tree representative of the at least a procedural rule according to the set of rule parameters,
the number of elementary geometries to be generated corresponding to the determined number of terminal symbols.

### Claim 11 (depends on 10)

The device according to claim 10, wherein the at least a processor is further configured assigning one single indexed elementary geometry to each terminal symbol.

### Claim 12 (depends on 10)

The device according to claim 10, wherein the computer graphic image is rendered from the grammar.

### Claim 13 (depends on 8)

The device according to claim 8, wherein the elementary geometries correspond to triangles, the triangles being obtained from quadrilaterals subdivided into two triangles, each quadrilateral comprising a lower triangle and an upper triangle, the at least a processor being further configured, for each elementary geometry of the at least a part of the elementary geometries, for:
determining the minimal coordinates (xmin, ymin) of the elementary geometry, xmin and ymin being normalized between 0 and 1,
determining if the elementary geometry is an upper triangle or a lower triangle, and
determining the index value to be assigned to the elementary geometry, the index value being equal to:
i xmin+2j ymin, i.xmin+2.i.j.ymin, if the elementary geometry is a lower triangle, or
i


x
min
+
2

ij

(
y
min
+
1
2

j
)
,
if the elementary geometry is an upper triangle,
wherein i×j corresponds to the number of quadrilaterals.

### Claim 14 (depends on 1)

A computer program product comprising instructions of program code for executing steps of the method according to claim 1, when said program is executed on a computer.
