An efficient algorithm for the computation of the metric average of two intersecting convex polygons, with application to morphing (Q878095)

An algorithm for computation of the metric average of 1D compact sets was introduced by \textit{R. Baier, N. Dyn} and \textit{E. Farkhi} [Approximation Theory X, Vanderbilt University Press, Nashville, 9--22 (2002; Zbl 1043.65034)]. The authors develop here an algorithm for the computation of the metric average between two intersecting convex polygons in 2D. A new non-intuitive approach to the morphing of 2D shapes, which does not require a search of corresponding parts, is suggested.