Normal vector compression of 3D mesh model based on clustering and relative indexing

As the transmission of 3D shape models through Internet becomes more important, the compression issue of shape models gets more critical. While the compressions of topology and geometry have been explored significantly, the same issue for normal vectors has not yet been studied as much as it deserves. Presented in this paper is an approach to compress the normal vectors of a 3D mesh model using the concept of clustering and relative indexing. The model is assumed to be manifold triangular mesh model with normal vectors associated with vertices. The proposed scheme clusters the normal vectors of given model and the representative normal vector of each cluster is referred to via a mixed use of relative as well as absolute indexing concepts. It turns out that the proposed approach achieves a significant compression ratio (less than 10% of the original VRML model files) without a serious sacrifice of the visual quality.

[1]  Wolfgang Straßer,et al.  Real time compression of triangle mesh connectivity , 1998, SIGGRAPH.

[2]  Hyeong-Seok Ko,et al.  Vertex data compression for triangular meshes , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.

[3]  M. Carter Computer graphics: Principles and practice , 1997 .

[4]  Gabriel Taubin,et al.  Geometry coding and VRML , 1998, Proc. IEEE.

[5]  Jarek Rossignac,et al.  Edgebreaker: Connectivity Compression for Triangle Meshes , 1999, IEEE Trans. Vis. Comput. Graph..

[6]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[7]  Michael Deering,et al.  Geometry compression , 1995, SIGGRAPH.

[8]  Jack Dongarra,et al.  Computational Science — ICCS 2002 , 2002, Lecture Notes in Computer Science.

[9]  Hwan-Gue Cho,et al.  An improved TIN compression using Delaunay triangulation , 1999, Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Cat. No.PR00293).

[10]  Mike M. Chow Optimized geometry compression for real-time rendering , 1997 .

[11]  Deok-Soo Kim,et al.  The Compression of the Normal Vectors of 3D Mesh Models Using Clustering , 2002, International Conference on Computational Science.

[12]  Hugues Hoppe,et al.  Efficient implementation of progressive meshes , 1998, Comput. Graph..

[13]  Gabriel Taubin,et al.  Geometric compression through topological surgery , 1998, TOGS.