How to Morph a Tree on a Small Grid
Computational Geometry
2019-09-30 v2 Discrete Mathematics
Data Structures and Algorithms
Abstract
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.
Keywords
Cite
@article{arxiv.1909.07093,
title = {How to Morph a Tree on a Small Grid},
author = {Fidel Barrera-Cruz and Manuel Borrazzo and Giordano Da Lozzo and Giuseppe Di Battista and Fabrizio Frati and Maurizio Patrignani and Vincenzo Roselli},
journal= {arXiv preprint arXiv:1909.07093},
year = {2019}
}
Comments
A preliminary version of this paper appears in WADS 2019