Systems and methods for creating a three-dimensional texture atlas

Patent metadata

Field	Value
Publication number	US-9378587-B2
Application number	US-201214411619-A
Country	US
Kind code	B2
Filing date	Jun 27, 2012
Priority date	Jun 27, 2012
Publication date	Jun 28, 2016
Grant date	Jun 28, 2016

Abstract

Systems and methods for reducing the amount of texture cache memory needed to store a texture atlas by using uniquely grouped refined triangles to create each texture atlas.

First claim

The invention claimed is:

1. A method for creating a three-dimensional texture atlas, which comprises:
subdividing a three-dimensional triangle mesh into a plurality of refined triangles;
grouping the plurality of refined triangles into one or more groups of refined triangles using a computer processor wherein the one or more groups of refined triangles are grouped according to their spatial relationship to an octree leaf;
scanning each group of refined triangles within a three-dimensional bounding volume to form a standardized texture tile or a non-standardized texture tile;
reducing an amount of computer texture cache memory required to store a texture atlas by combining each standardized texture tile to form at least one three-dimensional texture atlas; and
storing each texture atlas in the computer texture cache memory, wherein the at least one three-dimensional texture atlas comprises an equal number of standardized texture tiles in each dimension of the at least one three-dimensional texture atlas.

2. The method of claim 1 , wherein the three-dimensional triangle mesh is subdivided into the plurality of refined triangles by repeatedly dividing a longest edge length of each triangle in the three-dimensional triangle mesh until each triangle is less than or equal to a maximum refined triangle size.

3. The method of claim 2 , wherein the maximum refined triangle size is a predetermined longest edge length for each refined triangle.

4. The method of claim 1 , wherein each refined triangle is substantially the same size and shape.

5. The method of claim 1 , wherein each group of refined triangles within a three-dimensional bounding volume is scanned to form the standardized texture tile when a size of the three-dimensional bounding volume meets a preferred three-dimensional bounding volume size.

6. The method of claim 5 , wherein each dimension of the preferred three-dimensional bounding volume is less than or equal to 2 k and k equals any positive integer that limits the size of the preferred three-dimensional bounding volume to an octree leaf size plus a maximum refined triangle size.

7. The method of claim 6 , wherein each dimension of the octree leaf size defines a volume and each dimension of its volume is at least three times larger than a longest edge length that defines the maximum refined triangle size.

8. The method of claim 5 , wherein each standardized texture tile is substantially the same size and shape.

9. A non-transitory program carrier device tangibly carrying computer executable instructions for creating a three-dimensional texture atlas, the instructions being executable to implement:
subdividing a three-dimensional triangle mesh into a plurality of refined triangles;
grouping the plurality of refined triangles into one or more groups of refined triangles wherein the one or more groups of refined triangles are grouped according to their spatial relationship to an octree leaf;
scanning each group of refined triangles within a three-dimensional bounding volume to form a standardized texture tile or a non-standardized texture tile;
reducing an amount of computer texture cache memory required to store a texture atlas by combining each standardized texture tile to form at least one three-dimensional texture atlas; and
storing each texture atlas in the computer texture cache memory wherein the at least one three-dimensional texture atlas comprises an equal number of standardized texture tiles in each dimension of the at least one three-dimensional texture atlas.

10. The program carrier device of claim 9 , wherein the three-dimensional triangle mesh is subdivided into the plurality of refined triangles by repeatedly dividing a longest edge length of each triangle in the three-dimensional triangle mesh until each triangle is less than or equal to a maximum refined triangle size.

11. The program carrier device of claim 10 , wherein the maximum refined triangle size is a predetermined longest edge length for each refined triangle.

12. The program carrier device of claim 9 , wherein each refined triangle is substantially the same size and shape.

13. The program carrier device of claim 9 , wherein each group of refined triangles within a three-dimension bounding volume is scanned to form the standardized texture tile when a size of the three-dimensional bounding volume meets a preferred three-dimensional bounding volume size.

14. The program carrier device of claim 13 , wherein each dimensional of the preferred three-dimensional bounding volume is less than or equal to 2 k and k equals any positive integer that limits the size of the preferred three-dimensional bounding volume to an octree leaf size plus a maximum refined triangle size.

15. The program carrier device of claim 14 , wherein each dimension of the octree leaf size defines a volume and each dimension of its volume is at least three times larger than a longest edge length that defines the maximum refined triangle size.

16. The program carrier device of claim 13 , wherein each standardized texture tile is substantially the same size and shape.

Assignees

• Xu Zitao
• Viswanathan Venkatraman
• Senften Scott
• Sembroski Charles
• Sun Ya
• Cole Mary
• Landmark Graphics Corp

Inventors

• Xu Zitao
• Viswanathan Venkatraman
• Senften Scott
• Sembroski Charles
• Sun Ya
• Cole Mary

Classifications

• G06T1/60

  Memory management · CPC title

• G06T17/205

  Re-meshing · CPC title

• G06T15/04

  Texture mapping · CPC title

• G06T11/40 Primary

  Filling planar surfaces by adding surface attributes, e.g. adding colours or textures · CPC title

• G06T2210/36

  Level of detail · CPC title