1 paper
Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson
We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an n-vertex pla…