Winkler, Tim Drieseberg, Jens Alexa, Marc Hormann, Kai 2010 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 the hierarchical scheme for generating consolidated vertex positions, the approach is fast and can be applied to very large meshes. application/pdf https://localhost:5000/ark:/12658/srd1318201 https://sonar.ch/global/documents/318201 https://sonar.ch/documents/318201/files/hormann_CGF_2010.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1111/j.1467-8659.2009.01600.x info:eu-repo/semantics/altIdentifier/ark/12658/srd1318201 info:eu-repo/semantics/openAccess License undefined Computer graphics forum. - Wiley. - 2010, vol. 29, no. 2, p. 309-318 Computational geometry and object modeling hierarchy and geometric transformations info:eu-repo/classification/udc/004 Multi-scale geometry interpolation http://purl.org/coar/resource_type/c_6501