• Citer

Pole Dancing: 3D Morphs for Tree Drawings

par Arseneva, E.;Bose, Prosenjit ;Cano, P.;D'Angelo, A.;Dujmovic, V.;Frati, Fabrizio;Langerman, Stefan ;Tappini, A.
Référence 26th International Symposium on Graph Drawing and Network Visualization (GD 2018), Vol. 11282, page (371-384)
Publication Publié, 2018

Publication dans des actes

• Détails
• Contenu

Résumé :

We study the question whether a crossing-free 3D morph between two straight-line drawings of an n-vertex tree can be constructed consisting of a small number of linear morphing steps. We look both at the case in which the two given drawings are two-dimensional and at the one in which they are three-dimensional. In the former setting we prove that a crossing-free 3D morph always exists with O(log n) steps, while for the latter Θ(n) steps are always sufficient and sometimes necessary.