z-logo
Premium
Mesh decomposition using motion information from animation sequences
Author(s) -
Lee TongYee,
Lin PingHsien,
Yan ShaurUei,
Lin ChunHao
Publication year - 2005
Publication title -
computer animation and virtual worlds
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.225
H-Index - 49
eISSN - 1546-427X
pISSN - 1546-4261
DOI - 10.1002/cav.79
Subject(s) - computer science , animation , polygon mesh , computer animation , decomposition , computer graphics (images) , representation (politics) , computer graphics , sequence (biology) , t vertices , motion (physics) , construct (python library) , algorithm , theoretical computer science , artificial intelligence , mesh generation , finite element method , ecology , genetics , physics , politics , political science , law , biology , programming language , thermodynamics
In computer graphics, mesh decomposition is a fundamental problem and it can benefit many applications. In this paper, we propose a novel mesh decomposition algorithm using motion information derived from a given animation sequence. The proposed algorithm first use principal component analysis (PCA) to construct a compact representation of a given animation sequence. Next, from this representation, we derive several motion parameters including motion complexity and similarity. Finally, we decompose a given mesh into sub‐meshes using derived motion information and subdivide the triangles along the cutting paths for the smoother borders between the mesh parts. Our experimental results show that this new decomposition scheme can bring the benefit of good compression ratios on animation sequences. Copyright © 2005 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here