In a follow-up to my talk from last quarter, I will present an algorithm for computing a discrete planar morph between two straight-line drawings of a graph. This time, the algorithm maintains straight-line edges at all times.
(Based on a paper from SODA'13 by Alamdari, Angelini, Chan, Di Battista, Frati, Lubiw, Patrignani, Rosellini, Singla, and Wilkinson.)