I will present an algorithm for computing a discrete (consisting of a polynomial number of linear morphs) planar morph between two planar straight-line drawings of a graph. It achieves polynomial size at the expense of allowing edge bends.
(A paper by A. Lubiw and M. Petrick)