Multiresolution morphing for planar curves - Archive ouverte HAL Access content directly
Journal Articles Computing Year : 2007

Multiresolution morphing for planar curves


We present a multiresolution morphing algorithm using "as-rigid-as-possible" shape interpolation combined with an angle-length based multiresolution decomposition of simple 2D piecewise curves. This novel 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.
Fichier principal
Vignette du fichier
HBCC07-computing.pdf (596.39 Ko) Télécharger le fichier
Vignette du fichier
IMG1.jpg (29.22 Ko) Télécharger le fichier
Vignette du fichier
IMG2.jpg (41.68 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Format : Figure, Image

Dates and versions

hal-00319634 , version 1 (09-09-2008)



Stefanie Hahmann, Georges-Pierre Bonneau, Baptiste Caramiaux, Mélanie Cornillac. Multiresolution morphing for planar curves. Computing, 2007, 79 (2-4), pp.197-209. ⟨10.1007/s00607-006-0198-7⟩. ⟨hal-00319634⟩
441 View
663 Download



Gmail Facebook X LinkedIn More