A Novel Animation Method Based on Mesh Decimation

Skeleton based skin deformation methods are widely used in computer animations, with the help of some animation software, like 3D Studio Max and Maya. Most of these animation methods are based on linear blending skinning algorithm and its improved versions, showing good real-time performance. However, it is difficult for new users to use these complicated softwares to make animation. In this paper, we focus on surface based mesh deformation methods. We use spokes and rims deformation method to animate mesh models. However, this method shows poor real-time performance with high-resolution mesh models. We propose a novel animation method based on mesh decimation, making it possible to animate high-resolution mesh models in real time with the spokes and rims method. In this way, users only need to control the movement of handles to acquire intuitively reasonable animation of arbitrary mesh model. It is easier and more convenient for users to make their own animation. The experimental results show that the proposed animation method is feasible and effective and shows great real-time performance.

Mesh Simplification - A New Approach

Pemudahan permukaan telah menjadi topik kajian yang menarik dalam beberapa dekad ini. Sesetengah penyelidik memperkenalkan kaedah yang baharu manakala penyelidik lain melakukan pengubahsuaian ataupun penambahbaikan terhadap kaedah yang sedia ada. Walau bagaimanapun, model yang telah dipermudahkan mempunyai kecenderungan untuk kehilangan sebahagian daripada bentuk asalnya. Dalam pada itu, untuk mengatasi segala masalah ini, satu algoritma baru diperkenalkan, di mana formula nisbah digunakan untuk mengenal pasti calon elemen yang layak untuk dibuang. Elemen yang digunakan dalam algoritma baru ini adalah segitiga. Keputusan kajian menunjukkan bahawa algoritma yang dicadangkan dapat mengekalkan bentuk permukaan model asal. Kata kunci: Permudahan permukaan; persamaan rasional; berjenis; segitiga kontraksi; penipisan permukaan Mesh simplification has become an interesting research area over the past few decades. Some researchers have introduced various new methods while others have made some modifications or improvements to the existing method. However, the modified model tended to lose some of its original shape. Hence, to solve these arising problems, a new decimation algorithm is introduced, in which rational equation is used to select elements as candidates to be removed. The proposed algorithm also uses triangular mesh as the element. The results show that our proposed algorithm can preserve the shape of the mesh. Key words: Mesh simplification; rational equation; manifold; triangle contraction; mesh decimation

Surface Meshes Incremental Decimation Framework

When dealing with meshes, it is often preferable to work with a lower resolution mesh for computational time purpose, display. The process of reducing a given mesh, mesh decimation, is thus an important step in most of pipeline dealing with meshes. Incremental decimation algorithms, the most popular ones, consists of iteratively removing one point of the mesh, by Euler operations such as vertex removal or edge collapse. Here we focus on edge collapse based decimation approaches and propose a general framework based on a surface mesh data structure (itk::QuadEdgeMesh [3]). Our implementation intends to be as general and as flexible as possible. Indeed it can theoretically be applied on any polygonal mesh1; the measure, functional to be optimized at each iteration, the objective to be reached, and optional methods like point relocation to enhance the geometry of the resulting mesh, are given by the user. We provide here two specific implementations: itk::QuadEdgeMeshSquaredEdgeLengthDecimation and itk::QuadEdgeMeshQuadricDecimation, that could be used as example to implement additional algorithms.