Pole Dancing: 3D Morphs for Tree Drawings

DOI10.1007/978-3-030-04414-5_27MaRDI QIDQ6306080arXivFDO

Authors Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmović, Fabrizio Frati, Stefan Langerman, Alessandra Tappini

Publication date 31 August 2018

Published in arXiv

Full work available at URL https://doi.org/10.1007/978-3-030-04414-5_27

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

arXiv classification

cs.CGcs.DSmath.CO

Abstract: 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(logn)$ steps, while for the latter $Theta(n)$ steps are always sufficient and sometimes necessary.

This page was built for publication: Pole Dancing: 3D Morphs for Tree Drawings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6306080)