Abstract
The growth of computational power of contemporary hardware causes technologies working with 3D-data to expand. Examples of the use of this kind of data can be found in geography or gaming industry. 3D-data may not be only static, but also dynamic.
One way of animated 3D-data representation is expressing them by ”dynamic triangle mesh”. This kind of data representation is usually voluminous and needs to be compressed for efficient storage and transmission. In this paper, we are dealing with the influence of vertex clustering on dynamic mesh compression. The mesh is divided into vertex clusters based on the vertex movement similarity and compressed per-partes to achieve higher compression performance. We use Coddyac as a basic compression algorithm and extend it by adding well known clustering algorithms to demonstrate the efficiency of this approach. We also addres the choice of optimal clustering strategy for the Coddyac algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Váša, L., Skala, V.: CoDDyAC: Connectivity Driven Dynamic Mesh Compression. In: Proceedings of 3DTV Conference 2007 (2007)
Smith, L.I.: A tutorial on Principal Component Analysis (2002)
Rossignac, J.: Edgebreaker: Connectivity compression for triangle meshes. IEEE Transactions on Visualization and Computer Graphics 5(1) (January - March 1999)
Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An Efficient k-Means Clustering Algorithm: Analysis and Implementation. IEEE Transactions on pattern analysis and machine inteligence 24(7) (July 2002)
Mamou, K., Zaharia, T., Prêteux, F.: FAMC: The MPEG-4 Standard for Animated Mesh Compression. ARTEMIS Department, Institut TELECOM
Charikar, M., Khuller, S., Mount, D.M., Narasimhan, G.: Algorithms for facility location problem with outliers. In: Symposium on Discrete Algorithms, pp. 642–651 (2001)
Karni, Z., Gotsman, C.: Compression of soft-body animation sequences. Elsevier Computer & Graphics 28, 25–34 (2004)
Váša, L., Skala, V.: COBRA: Compression of the Basis for PCA Represented Animations. Computer Graphics Forum 28, 1529–1540 (2009)
Amjoun, R., Straer, W.: Efficient Compression of 3D Dynamic Mesh Sequences. Journal of the WSCG (2007)
Sattler, M., Sarlette, R., Klein, R.: Simple and Efficient Compression of Animation Sequances. In: Proceedings of the 2005 ACM SIGGRAPH/Eurographics Symposium on Computer Animation (SCA 2005), pp. 209–217 (2005)
Gotsman, C., Touma, C.: Triangle Mesh Compression. In: Graphics Interface, pp. 26–34 (1998)
Skála, J., Kolingerová, I.: Clustering Geometric Data Streams. In: SIGRAD, pp. 17–23 (2007)
Kavan, L., Sloan, P., O’Sullivan, C.: Fast and Efficient Skinning of Animated Meshes. In: Eurographics 2010 (2010)
Alexa, M., Müller, W.: Representing Animations by Principal Components. Computer Graphics Forum 19(3) (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rus, J., Váša, L. (2010). Analysing the Influence of Vertex Clustering on PCA-Based Dynamic Mesh Compression. In: Perales, F.J., Fisher, R.B. (eds) Articulated Motion and Deformable Objects. AMDO 2010. Lecture Notes in Computer Science, vol 6169. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14061-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-14061-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14060-0
Online ISBN: 978-3-642-14061-7
eBook Packages: Computer ScienceComputer Science (R0)