高级检索

    保细节的网格刚性变形算法

    Rigid Mesh Deformation with Detail Preserving

    • 摘要: 提出了一种新的保细节的变形算法,可以使网格模型进行尽量刚性的变形,以减少变形中几何细节的扭曲.首先根据网格曲面局部细节的丰富程度,对原始网格进行聚类生成其简化网格;然后对简化网格进行变形,根据其相邻面片变形的相似性,对简化网格作进一步的合并,生成新的变形结果,将该变形传递给原始网格作为初始变形结果.由于对属于同一个类的网格顶点进行相同的刚性变形,可在变形中较好地保持该区域的表面细节,但分属不同类的顶点之间会出现变形的不连续.为此,通过迭代优化一个二次能量函数,对每个网格顶点的变形进行调整来得到最终变形结果.实验结果显示, 该算法简单高效,结果令人满意.

       

      Abstract: Mesh deformation with detail preserving is very important in many application fields, such as online game, computer animation, digital entertainment, movie production, computer aided design, military simulation and virtual worlds. However, it is a challenging problem in computer graphics to efficiently edit complex triangular meshes for existing deformation techniques. In this paper, a novel mesh deformation algorithm with detail preserving is presented. It deforms the input mesh as rigidly as possible, hence greatly reducing surface detail distortion even under large deformations. This approach first conducts clustering-based simplification on the original mesh according to the richness of local details. The simplified mesh is then deformed, and adjacent vertices undergoing similar transformation are merged into one vertex. By local frame encoding, this deformation is then transferred to the original mesh to generate an initial deformation result. Since vertices belonging to the same cluster undergo the same rigid transformation, discontinuity will occur between vertices belonging to different clusters. To prevent these artifacts, the position of each vertex is further adjusted by iteratively minimizing a quadric energy function to arrive at the final deformation result. Various experiment results show that the presented algorithm is simple, easy to use, robust and very effective in preserving surface details.

       

    /

    返回文章
    返回