Vertex Data Compression for Triangular Meshes

Authors:
Eung-Seok Lee;Hyeong-Seok Ko
Affiliations:
-;-
Venue:
PG '00 Proceedings of the 8th Pacific Conference on Computer Graphics and Applications
Year:
2000

Citing 0
Cited 10

Compressing polygon mesh geometry with parallelogram prediction

Proceedings of the conference on Visualization '02
3D mesh compression using fixed spectral bases

GRIN'01 No description on Graphics interface 2001
Out-of-core compression for gigantic polygon meshes

ACM SIGGRAPH 2003 Papers
Normal vector compression of 3D mesh model based on clustering and relative indexing

Future Generation Computer Systems - Special issue: Computer graphics and geometric modeling
Predictive vector quantization of 3-D mesh geometry by representation of vertices in local coordinate systems

Journal of Visual Communication and Image Representation
MPEG-4 Part 25: A graphics compression framework for XML-based scene graph formats

Image Communication
Single-rate near lossless compression of animated geometry

Computer-Aided Design
Normal vector compression of 3D mesh model based on clustering and relative indexing

Future Generation Computer Systems
Technologies for 3D mesh compression: A survey

Journal of Visual Communication and Image Representation
Iterative image coding using hybrid wavelet-based triangulation

MMM'07 Proceedings of the 13th international conference on Multimedia Modeling - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the field of geometry compression, two main compression targets exist. One is triangle connectivity data and the other is vertex position data. In this paper, we propose a novel algorithm to compress the vertex data. A fundamentally different approach we took in this 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 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 the previous methods.