Compression of Complex Animated Meshes

  • Rachida Amjoun
  • Ralf Sondershaus
  • Wolfgang Straßer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4035)


We introduce a new compression algorithm for complex animated meshes of constant connectivity based on the local principal component analysis. The algorithm segments the animated mesh into segments using a region growing algorithm and transforms the original vertex coordinates into the local coordinate frame of their segment. This transformation leads to a strong clustering behavior of vertices and makes each region invariant to any deformation over time. Then each segment is efficiently encoded using the principal component analysis. The set of basis vectors and coefficients corresponding to each segment are quantized and entropy encoded. Experimental results show that our algorithm yields a significant improvement upon some current coders.


Principal Component Analysis Local Coordinate System Arithmetic Coder Correction Vector Standard Principal Component Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Lengyel, J.E.: Compression of time-dependent geometry. In: Proceedings of the 1999 symposium on Interactive 3D graphics, pp. 89–95. ACM Press, New York (1999)CrossRefGoogle Scholar
  2. 2.
    Alexa, M., Müller, W.: Representing animations by principal components. Comput. Graph. Forum 19(3) (2000)Google Scholar
  3. 3.
    Karni, Z., Gotsman, C.: Compression of soft-body animation sequences. Computer and Graphics 28, 25–34 (2004)CrossRefGoogle Scholar
  4. 4.
    Sattler, M., Sarlette, R., Klein, R.: Simple and efficient compression of animation sequences. In: Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation, pp. 209–217. ACM Press, New York (2005)CrossRefGoogle Scholar
  5. 5.
    Ibarria, L., Rossignac, J.: Dynapack: space-time compression of the 3d animations of triangle meshes with fixed connectivity. In: Proceedings of the 2003 ACM SIGGRAPH/Eurographics Symposium on Computer Animation (2003)Google Scholar
  6. 6.
    Guskov, I., Khodakovsky, A.: Wavelet compression of parametrically coherent mesh sequences. In: SCA 2004: Proceedings of the 2004 ACM SIGGRAPH/Eurographics symposium on Computer animation, pp. 183–192. ACM Press, New York (2004)CrossRefGoogle Scholar
  7. 7.
    Payan, F., Antonini, M.: Wavelet-based compression of 3d mesh sequences. In: Proceedings of IEEE ACIDCA-ICMI 2005, Tozeur, Tunisia (2005)Google Scholar
  8. 8.
    Yan, Z., Kumar, S., Kuo, C.C.J.: Error-resilient coding of 3-d graphic models via adaptive mesh segmentation. IEEE Trans. Circuits Syst. Video Techn. 11(7), 860–873 (2001)CrossRefGoogle Scholar
  9. 9.
    Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. Communications of the ACM 30(6), 520–540 (1987)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Rachida Amjoun
    • 1
  • Ralf Sondershaus
    • 1
  • Wolfgang Straßer
    • 1
  1. 1.WSI-GRISUniversity of TübingenTübingenGermany

Personalised recommendations