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.
No takes yet. Share an insight, caveat, or question.
Lee et al. (2005) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:
More from Computer Animation and Virtual Worlds