Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Morphing Tree Drawings in a Small 3D Grid. / Истомина, Александра Андреевна; Арсеньева, Елена Александровна; Гангопадхай, Рауль.
WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Proceedings. ed. / Petra Mutzel; Md. Saidur Rahman; Slamin. Springer Nature, 2022. p. 85-96 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13174 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Morphing Tree Drawings in a Small 3D Grid
AU - Истомина, Александра Андреевна
AU - Арсеньева, Елена Александровна
AU - Гангопадхай, Рауль
N1 - Publisher Copyright: © 2022, Springer Nature Switzerland AG.
PY - 2022/3/23
Y1 - 2022/3/23
N2 - We study crossing-free grid morphs for planar tree drawings using the third dimension. A morph consists of morphing steps, where vertices move simultaneously along straight-line trajectories at constant speeds. There is a crossing-free morph between two drawings of an n-vertex planar graph G with O(n) morphing steps, and using the third dimension the number of steps can be reduced to O(log n) for an n-vertex tree [Arseneva et al. 2019]. However, these morphs do not bound one practical parameter, the resolution. Can the number of steps be reduced substantially by using the third dimension while keeping the resolution bounded throughout the morph? We present a 3D crossing-free morph between two planar grid drawings of an n-vertex tree in O(nlogn) morphing steps. Each intermediate drawing lies in a 3D grid of polynomial volume.
AB - We study crossing-free grid morphs for planar tree drawings using the third dimension. A morph consists of morphing steps, where vertices move simultaneously along straight-line trajectories at constant speeds. There is a crossing-free morph between two drawings of an n-vertex planar graph G with O(n) morphing steps, and using the third dimension the number of steps can be reduced to O(log n) for an n-vertex tree [Arseneva et al. 2019]. However, these morphs do not bound one practical parameter, the resolution. Can the number of steps be reduced substantially by using the third dimension while keeping the resolution bounded throughout the morph? We present a 3D crossing-free morph between two planar grid drawings of an n-vertex tree in O(nlogn) morphing steps. Each intermediate drawing lies in a 3D grid of polynomial volume.
KW - 3D morphing
KW - bounded resolution
KW - morphing grid drawings
UR - http://www.scopus.com/inward/record.url?scp=85127853525&partnerID=8YFLogxK
U2 - 10.48550/arXiv.2106.04289
DO - 10.48550/arXiv.2106.04289
M3 - Conference contribution
SN - 978-3-030-96730-7
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 85
EP - 96
BT - WALCOM
A2 - Mutzel, Petra
A2 - Rahman, Md. Saidur
A2 - Slamin, null
PB - Springer Nature
Y2 - 24 March 2022 through 26 March 2022
ER -
ID: 97470930