IMPLIED MESH TOPOLOGIES IN DENSE GEOMETRY FORMAT ENCODING
案件概要
発明者
David Kirk McAllister; Carsten Benthin; Joshua David Barczak; Andrew Erin Kensler; Mohammed Ahmed Muneam Al-Obaidi
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, which means 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. While the format provides good compression characteristics, improvement can be gained by eliminating the indices and instead using an indication of an “implicit geometry.” The implicit geometry is a commonly-used geometry type that indicates a particular correspondence between unique vertices and triangles. In other words, by indicating an implicit geometry type, it is automatically known which vertices make up which triangles, and explicit index information does not need to be stored in the compressed data structure.
原文(中国語)
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, which means 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. While the format provides good compression characteristics, improvement can be gained by eliminating the indices and instead using an indication of an “implicit geometry.” The implicit geometry is a commonly-used geometry type that indicates a particular correspondence between unique vertices and triangles. In other words, by indicating an implicit geometry type, it is automatically known which vertices make up which triangles, and explicit index information does not need to be stored in the compressed data structure.
外部リソース