a linear number of morphing steps suffices, and is sometimes necessary, to construct a morph between any two straight-line planar drawings of a graph.

Although the results mentioned in the previous paragraph establish strong theoretical foundations for the topic of morphing graph drawings, they produce morphs that are not appealing from a visualization perspective. Namely, such algorithms produce drawings that have poor *resolution*, i.e., they may have an exponential ratio of the distances between the farthest and closest pairs of geometric objects (points representing nodes or segments representing edges), even if the same ratio is polynomially bounded in the initial and final drawings. Indeed, most of the above cited papers mention the problem of constructing morphs with bounded resolution as the main challenge in this research area.

The only paper we are aware of where the resolution problem has been successfully addressed is the one by Barrera-Cruz et al. [@DBLP:conf/gd/Barrera-CruzHL14], who showed how to construct a morph with polynomially-bounded resolution between two *Schnyder drawings* $\Gamma_0$ and $\Gamma_1$ of the same planar triangulation. The model they use in order to ensure a bound on the resolution requires that $\Gamma_0=\Delta_0,\Delta_1,\dots,\Delta_{k}=\Gamma_1$ are *grid drawings*, i.e., vertices have integer coordinates, and the resolution is 