Vertex data compression for triangular meshes
Eung-Seok Lee, Hyeong‐Seok Ko · 2000
In the field of geometry compression, two main compression targets exist. One is triangle connectivity data and the other is vertex position data. The authors propose a novel algorithm to compress the vertex data. A fundamentally different approach taken in the paper is to transform the vertex positions to the model space, a coordinate system formed by the three previously processed vertices. Once all the vertices are transformed, we found that the result shows a strong tendency to cluster around three points. We exploit such a tendency during the vector quantization steps to increase the compression ratio. According to the experiments performed on 12 models, the average compression performance of our algorithm is 6.7 bits/vertex, which is a clear improvement over previous methods.