Multiresolution morphing for planar curves

We present a multiresolution morphing algorithm using “as-rigid-as-possible” shape interpolation combinedwithanangle-lengthbasedmultiresolutiondecompositionofsimple2Dpiecewisecurves.Thisnovel multiresolution representation is defined intrinsically and has the advantage that the details’ orientation follows any deformation naturally. The multiresolution morphing algorithm consists of transforming separately the coarse and detail coefficients of the multiresolution decomposition. Thus all LoD (level of detail) applications like LoD display, compression, LoD editing etc. can be applied directly to all morphs without any extra computation. Furthermore, the algorithm can robustly morph between very large size polygons with many local details as illustrated in numerous figures. The intermediate morphs behave natural and least-distorting due to the particular intrinsic multiresolution representation. AMS Subject Classifications: 68U07, 68U05, 65D05, 65D08, 65D17.

• Type: Journal
• Year: 2007
• Where: COMPUTING
• Authors: Stefanie Hahmann, Georges-Pierre Bonneau, Baptiste Caramiaux, M. Cornillac
• Keywords: Algorithm, COMPUTING 2007, Multiresolution Decomposition, Multiresolution Representation