In this paper we study planar morphs between straight-line planar grid drawings of trees. A morph consists of a sequence of morphing steps, where in a morphing step vertices move along straight-line trajectories at constant speed. We show how to construct planar morphs that simultaneously achieve a reduced number of morphing steps and a polynomially-bounded resolution. We assume that both the initial and final drawings lie on the grid and we ensure that each morphing step produces a grid drawing; further, we consider both upward drawings of rooted trees and drawings of arbitrary trees.
CITATION STYLE
Barrera-Cruz, F., Borrazzo, M., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., & Roselli, V. (2019). How to morph a tree on a small grid. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11646 LNCS, pp. 57–70). Springer Verlag. https://doi.org/10.1007/978-3-030-24766-9_5
Mendeley helps you to discover research relevant for your work.