Multi-Scale Geometry Interpolation

Interpolating vertex positions among triangle meshes with identical vertex-edge graphs is a fundamental part of many geometric modelling systems. Linear vertex interpolation is robust but fails to preserve local shape. Most recent approaches identify local affine transformations for parts of the mesh, model desired interpolations of the affine transformations, and then optimize vertex positions to conform with the desired transformations. However, the local interpolation of the rotational part is non-trivial for more than two input configurations and ambiguous if the meshes are deformed significantly. We propose a solution to the vertex interpolation problem that starts from interpolating the local metric (edge lengths) and mean curvature (dihedral angles) and makes consistent choices of local affine transformations using shape matching applied to successively larger parts of the mesh. The local interpolation can be applied to any number of input vertex configurations and due to...

• Type: Conference
• Year: 2010
• Where: EUROGRAPHICS
• Authors: Tim Winkler, J. Drieseberg, Marc Alexa, Kai Hormann
• Keywords: Computer Graphics, Consolidated Vertex Positions, EUROGRAPHICS 2010, Linear Vertex Interpolation, Vertex Interpolation Problem