Pole Dancing: 3D Morphs for Tree Drawings
Document typeConference report
Rights accessRestricted access - publisher's policy
European Commisision's projectEC-MINECO-1PE
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 T(n) steps are always sufficient and sometimes necessary.
CitationArseneva, E. [et al.]. Pole Dancing: 3D Morphs for Tree Drawings. A: International Symposium on Graph Drawing and Network Visualization. "GD 2018: 26th International Symposium on Graph Drawing and Network Visualization: Barcelona, Spain: September 26-28, 2018: proceedings book". Berlín: Springer, p. 371-384.
|Graph Drawing and Network Visualization.pdf||503,5Kb||Restricted access|