Efficient compression of data representing triangular mesh attributes
AssigneeGoogle Inc.
InventorsIgor Vytyaz, Ondrej Stava, Michael Hemmer, Xiaoxu Meng
Life of this patent
Estimating the term…
Loading patent…
AssigneeGoogle Inc.
InventorsIgor Vytyaz, Ondrej Stava, Michael Hemmer, Xiaoxu Meng
Estimating the term…
Techniques of compressing triangular mesh data involve generating a neighborhood table (i.e., a table) of fixed size that represents a neighborhood of a predicted vertex of a triangle within a triangular mesh for input into a machine-learning (ML) engine. For example, such a neighborhood table as input into a ML engine can output a prediction for a value (e.g., a position) of a vertex. The residual between the prediction and the actual value of the vertex is stored in an array. The data in the array representing the residuals may be compressed and transmitted over a network. Upon receipt by a computer, the array may be decompressed by the computer. Obtaining the actual value involves the receiving computer generating the same neighborhood table, inputting that neighborhood table into the same ML engine to produce the predicted value, and adding the predicted value to the residual from the decompressed file.
A method, comprising:
The method as in claim 23, wherein generating the neighborhood table includes ordering the specified number of entries of the neighborhood table according to an implicit traversal of the neighborhood of the triangular mesh.
A method, comprising:
A computer program product comprising a nontransitory storage medium, the computer program product including code that, when executed by processing circuitry of a user device configured to represent information related to a surface of a three-dimensional object, causes the processing circuitry to perform a method, the method comprising:
An electronic apparatus configured to represent information related to a surface of a three-dimensional object, the electronic apparatus comprising:
Dependencies are inferred from the claim text.