DENSE GEOMETRY FORMAT ENCODINGS AS BASE MESH FOR SUBDIVISION SURFACES
개요
발명자
Carsten Benthin; David Kirk McAllister; Joshua David Barczak
IPC 분류
CPC 분류
A geometry compression format is described. The compression format eliminates the need to store duplicate vertex information by storing unique vertices in each compressed data structure. Different triangles can refer to the same vertex using an index value, meaning that even if the same vertex is used multiple times in the compressed data structure, the entirety of the vertex information (e.g., positional information) does not need to be stored multiple times. An improvement includes representing further subdivision of the geometry in an efficient manner to represent highly detailed geometry. The subdivision can be specified by sideband information which can specify any of a variety of types of information.
원문 (중국어)
A geometry compression format is described. The compression format eliminates the need to store duplicate vertex information by storing unique vertices in each compressed data structure. Different triangles can refer to the same vertex using an index value, meaning that even if the same vertex is used multiple times in the compressed data structure, the entirety of the vertex information (e.g., positional information) does not need to be stored multiple times. An improvement includes representing further subdivision of the geometry in an efficient manner to represent highly detailed geometry. The subdivision can be specified by sideband information which can specify any of a variety of types of information.