A local feature based simplification method for animated mesh sequence

Although animated meshes are frequently used in numerous domains, only few works have been proposed until now for simplifying such data. In this paper, we propose a new method for generating progressive animated models based on local feature analysis and deformation area preservation. We propose the use of solid angle and height value for a non-hyperbolic vertex to define the local feature parameter. This local factor is embedded to the vertex quadric error matrix when calculating the edge collapse cost. In order to preserve the areas with large deformation, we add deformation degree weight to the aggregated quadric errors when computing the unified edge contraction sequence. Finally, a mesh optimization process is proposed to further reduce the geometric distortion for each frame. Our approach is fast, easy to implement, and as a result good quality dynamic approximations with well-preserved fine details can be generated at any given frame.

[1]  Greg Turk,et al.  Re-tiling polygonal surfaces , 1992, SIGGRAPH.

[2]  Michael Garland,et al.  Hierarchical face clustering on polygonal surfaces , 2001, I3D '01.

[3]  Hélio Pedrini,et al.  A Comparative Evaluation of Metrics for Fast Mesh Simplification , 2006, Comput. Graph. Forum.

[4]  Valerio Pascucci,et al.  Multi-resolution dynamic meshes with arbitrary deformations , 2000, IEEE Visualization.

[5]  Michael Garland,et al.  Progressive multiresolution meshes for deforming surfaces , 2005, SCA '05.

[6]  M. Garland,et al.  Multiresolution Modeling: Survey & Future Opportunities , 1999 .

[7]  Hugues Hoppe,et al.  New quadric metric for simplifying meshes with appearance attributes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[8]  Valerio Pascucci,et al.  Temporal and spatial level of details for dynamic meshes , 2001, VRST '01.

[9]  David Zhang,et al.  Mesh simplification with hierarchical shape analysis and iterative edge contraction , 2004, IEEE Transactions on Visualization and Computer Graphics.

[10]  André Guéziec,et al.  Locally Toleranced Surface Simplification , 1999, IEEE Trans. Vis. Comput. Graph..

[11]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

[12]  Hugues Hoppe,et al.  Displaced subdivision surfaces , 2000, SIGGRAPH.

[13]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[14]  William E. Lorensen,et al.  Decimation of triangle meshes , 1992, SIGGRAPH.

[15]  Rao V. Garimella,et al.  Polygonal surface mesh optimization , 2004, Engineering with Computers.

[16]  Michael Gleicher,et al.  Deformation Sensitive Decimation , 2003 .

[17]  Ligang Liu,et al.  Non-iterative approach for global mesh optimization , 2007, Comput. Aided Des..

[18]  A. van Oosterom,et al.  The Solid Angle of a Plane Triangle , 1983, IEEE Transactions on Biomedical Engineering.

[19]  Kok-Lim Low,et al.  Model simplification using vertex-clustering , 1997, SI3D.

[20]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

[21]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[22]  Michael Garland,et al.  Multiresolution Modeling: Survey and Future Opportunities , 1999, Eurographics.