Abstract
Techniques for deforming polygonal meshes are demonstrated by using two-dimensional lattices of control points or functions for pasting features. The deformations use a shape-preserving parametrization that embeds the mesh's vertices in a normalized two-dimensional space while preserving shape consistency for non-flat surfaces. A discrete smoothing used for the parametrization has inefficient iterative calculations, which is unsuitable for manipulations of dense meshes, and an initial approximation for the smoothing is therefore proposed in order to reduce the number of iterations. The approximation uses a graph-searching algorithm and a discrete normalization whose computational costs are negligible in comparison with that of the iterative calculations.
