Pole Dancing: 3D Morphs for Tree Drawings

08/31/2018
by   Elena Arseneva, et al.
0

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

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset