Can I read Morphing Planar Graph Drawings Optimally on EtoBox?

Morphing Planar Graph Drawings Optimally by Angelini, Patrizio; Da Lozzo, Giordano; Di Battista, Giuseppe; Frati, Fabrizio; Patrignani, Maurizio; Roselli, Vincenzo is a scholarly article available to read on EtoBox.

What is Morphing Planar Graph Drawings Optimally about?

We provide an algorithm for computing a planar morph between any two planar straight-line drawings of any $n$-vertex plane graph in $O(n)$ morphing steps, thus improving upon the previously best known $O(n^2)$ upper bound. Further, we prove that our algorithm is optimal, that is, we show that there exist two planar straight-line drawings $\Gamma_s$ and $\Gamma_t$ of an $n$-vertex plane graph $G$ such that any planar morph between $\Gamma_s$ and $\Gamma_t$ requires $\Omega(n)$ morphing steps.

Author

Angelini, Patrizio; Da Lozzo, Giordano; Di Battista, Giuseppe; Frati, Fabrizio; Patrignani, Maurizio; Roselli, Vincenzo

Published

2014

Language

EN