.png){kind=icon}
Return
Multiresolution morphing for planar curves
.png){kind=icon}
OA
AI
DOI：10.1007/s00607-006-0198-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
geometric modeling
curves
multiresolution analysis
morphing
interpolation vertex correspondence
Journal
C
IF:
2.8
Papers:
2.3K
Citations:
3.5K
Organization
No organization information available
Cited Papers
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSaveIn silico analysis of serum miRNA profiles in seronegative and seropositive rheumatoid arthritis patients by small RNA sequencing.png)
PeerJOAAI
PeerJIF0
OAAIShareSaveShareSave
View more