Curve morphing by weighted mean of strings
Xiaoyi Jiang, Horst Bunke, K. Abegglen, Abraham Kandel · 2003
We propose an approach to curve morphing. We represent curves by strings, i.e. sequences of symbols. The curve morphing problem is formulated as that of, computing a weighted mean of two strings, which is then solved by a corresponding algorithm. Although only 2D curves are used in our experiments, the approach is applicable to curves in any dimension. Curve morphing has interesting applications in computer graphics, industrial design, robotics, etc. Additionally, it provides an alternative multiscale representation of curves.