Premium
As‐Rigid‐AsPossible Distance Field Metamorphosis
Author(s) -
Weng Yanlin,
Chai Menglei,
Xu Weiwei,
Tong Yiying,
Zhou Kun
Publication year - 2013
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12246
Subject(s) - morphing , image warping , interpolation (computer graphics) , computer science , rigidity (electromagnetism) , topology (electrical circuits) , distortion (music) , correspondence problem , algorithm , set (abstract data type) , computer vision , artificial intelligence , mathematics , motion (physics) , combinatorics , amplifier , computer network , structural engineering , bandwidth (computing) , engineering , programming language
Widely used for morphing between objects with arbitrary topology, distance field interpolation (DFI) handles topological transition naturally without the need for correspondence or remeshing, unlike surface‐based interpolation approaches. However, lack of correspondence in DFI also leads to ineffective control over the morphing process. In particular, unless the user specifies a dense set of landmarks, it is not even possible to measure the distortion of intermediate shapes during interpolation, let alone control it. To remedy such issues, we introduce an approach for establishing correspondence between the interior of two arbitrary objects, formulated as an optimal mass transport problem with a sparse set of landmarks. This correspondence enables us to compute non‐rigid warping functions that better align the source and target objects as well as to incorporate local rigidity constraints to perform as‐rigid‐aspossible DFI. We demonstrate how our approach helps achieve flexible morphing results with a small number of landmarks.