Show simple item record

Pole Dancing: 3D Morphs for Tree Drawings

dc.contributor.authorArseneva, Elena
dc.contributor.authorBose, Prosenjit
dc.contributor.authorCano Vila, María del Pilar
dc.contributor.authorD'Angelo, Anthony
dc.contributor.authorDujmovic, Vida
dc.contributor.authorFrati, Fabrizio
dc.contributor.authorLangerman, Stefan
dc.contributor.authorTappini, Alessandra
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2019-01-25T11:56:33Z
dc.date.issued2018
dc.identifier.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.
dc.identifier.isbn978-3-030-04414-5
dc.identifier.otherhttps://arxiv.org/abs/1808.10738
dc.identifier.urihttp://hdl.handle.net/2117/127585
dc.description.abstractWe 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.
dc.format.extent14 p.
dc.language.isoeng
dc.publisherSpringer
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Geometria
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi matemàtica
dc.subject.lcshCharts, diagrams, etc.
dc.subject.lcshDrawing
dc.subject.lcshKnot theory
dc.titlePole Dancing: 3D Morphs for Tree Drawings
dc.typeConference report
dc.subject.lemacGràfics
dc.subject.lemacDibuix
dc.subject.lemacInfografia tridimensional
dc.subject.lemacNusos, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. CGA - Computational Geometry and Applications
dc.identifier.doi10.1007/978-3-030-04414-5_27
dc.relation.publisherversionhttps://link.springer.com/chapter/10.1007/978-3-030-04414-5_27
dc.rights.accessRestricted access - publisher's policy
local.identifier.drac23609624
dc.description.versionPostprint (published version)
dc.relation.projectidinfo:eu-repo/grantAgreement/MINECO//MTM2015-63791-R/ES/GRAFOS Y GEOMETRIA: INTERACCIONES Y APLICACIONES/
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT
dc.relation.projectidinfo:eu-repo/grantAgreement/EC/H2020/734922/EU/Combinatorics of Networks and Computation/CONNECT
dc.date.lift10000-01-01
local.citation.authorArseneva, E.; Bose, P.; Cano, M.; D'Angelo, A.; Dujmovic, V.; Frati, F.; Langerman, S.; Tappini, A.
local.citation.contributorInternational Symposium on Graph Drawing and Network Visualization
local.citation.pubplaceBerlín
local.citation.publicationNameGD 2018: 26th International Symposium on Graph Drawing and Network Visualization: Barcelona, Spain: September 26-28, 2018: proceedings book
local.citation.startingPage371
local.citation.endingPage384


Files in this item

Thumbnail
Name:
Graph Drawing and Network ...
Size:
503,5Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record