Standard

Pole dancing: 3D morphs for tree drawings. / Arseneva, Elena; Bose, Prosenjit; Cano, Pilar; D’Angelo, Anthony; Dujmović, Vida; Frati, Fabrizio; Langerman, Stefan; Tappini, Alessandra.

Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings. ред. / Therese Biedl; Andreas Kerren. Springer Nature, 2018. стр. 371-384 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11282 LNCS).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференцийстатья в сборнике материалов конференцииРецензирование

Harvard

Arseneva, E, Bose, P, Cano, P, D’Angelo, A, Dujmović, V, Frati, F, Langerman, S & Tappini, A 2018, Pole dancing: 3D morphs for tree drawings. в T Biedl & A Kerren (ред.), Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 11282 LNCS, Springer Nature, стр. 371-384, 26th International Symposium on Graph Drawing and Network Visualization, GD 2018, Barcelona, Испания, 26/09/18. https://doi.org/10.1007/978-3-030-04414-5_27

APA

Arseneva, E., Bose, P., Cano, P., D’Angelo, A., Dujmović, V., Frati, F., Langerman, S., & Tappini, A. (2018). Pole dancing: 3D morphs for tree drawings. в T. Biedl, & A. Kerren (Ред.), Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings (стр. 371-384). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11282 LNCS). Springer Nature. https://doi.org/10.1007/978-3-030-04414-5_27

Vancouver

Arseneva E, Bose P, Cano P, D’Angelo A, Dujmović V, Frati F и пр. Pole dancing: 3D morphs for tree drawings. в Biedl T, Kerren A, Редакторы, Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings. Springer Nature. 2018. стр. 371-384. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-04414-5_27

Author

Arseneva, Elena ; Bose, Prosenjit ; Cano, Pilar ; D’Angelo, Anthony ; Dujmović, Vida ; Frati, Fabrizio ; Langerman, Stefan ; Tappini, Alessandra. / Pole dancing: 3D morphs for tree drawings. Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings. Редактор / Therese Biedl ; Andreas Kerren. Springer Nature, 2018. стр. 371-384 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{9fd5c70fe8504551905abb73df06aec0,
title = "Pole dancing: 3D morphs for tree drawings",
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(log n) steps, while for the latter Θ(n) steps are always sufficient and sometimes necessary.",
author = "Elena Arseneva and Prosenjit Bose and Pilar Cano and Anthony D{\textquoteright}Angelo and Vida Dujmovi{\'c} and Fabrizio Frati and Stefan Langerman and Alessandra Tappini",
year = "2018",
month = jan,
day = "1",
doi = "10.1007/978-3-030-04414-5_27",
language = "English",
isbn = "9783030044138",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "371--384",
editor = "Therese Biedl and Andreas Kerren",
booktitle = "Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings",
address = "Germany",
note = "26th International Symposium on Graph Drawing and Network Visualization, GD 2018 ; Conference date: 26-09-2018 Through 28-09-2018",

}

RIS

TY - GEN

T1 - Pole dancing: 3D morphs for tree drawings

AU - Arseneva, Elena

AU - Bose, Prosenjit

AU - Cano, Pilar

AU - D’Angelo, Anthony

AU - Dujmović, Vida

AU - Frati, Fabrizio

AU - Langerman, Stefan

AU - Tappini, Alessandra

PY - 2018/1/1

Y1 - 2018/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85059074940&partnerID=8YFLogxK

U2 - 10.1007/978-3-030-04414-5_27

DO - 10.1007/978-3-030-04414-5_27

M3 - Conference contribution

AN - SCOPUS:85059074940

SN - 9783030044138

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 371

EP - 384

BT - Graph Drawing and Network Visualization - 26th International Symposium, GD 2018, Proceedings

A2 - Biedl, Therese

A2 - Kerren, Andreas

PB - Springer Nature

T2 - 26th International Symposium on Graph Drawing and Network Visualization, GD 2018

Y2 - 26 September 2018 through 28 September 2018

ER -

ID: 39288412