Back to Search
Start Over
Morphing Planar Graph Drawings Optimally
- Publication Year :
- 2014
-
Abstract
- 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.
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.1402.4364
- Document Type :
- Working Paper