We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear complexity. The linear bound is asymptotically optimal in the worst case.
@article{arxiv.1503.09021,
title = {Optimal Morphs of Convex Drawings},
author = {Patrizio Angelini and Giordano Da Lozzo and Fabrizio Frati and Anna Lubiw and Maurizio Patrignani and Vincenzo Roselli},
journal= {arXiv preprint arXiv:1503.09021},
year = {2015}
}