Optimal morphs of planar orthogonal drawings II

Onderzoeksoutput: Hoofdstuk in Boek/Rapport/CongresprocedureConferentiebijdrageAcademicpeer review

1 Citaat (Scopus)

Samenvatting

Van Goethem and Verbeek [12] recently showed how to morph between two planar orthogonal drawings (Forumala Presented). of a connected graph G while preserving planarity, orthogonality, and the complexity of the drawing during the morph. Necessarily drawings (Forumala Presented). must be equivalent, that is, there exists a homeomorphism of the plane that transforms (Forumala Presented). Van Goethem and Verbeek use O(n) linear morphs, where n is the maximum complexity of the input drawings. However, if the graph is disconnected their method requires (Forumala Presented). linear morphs. In this paper we present a refined version of their approach that allows us to also morph between two planar orthogonal drawings of a disconnected graph with O(n) linear morphs while preserving planarity, orthogonality, and linear complexity of the intermediate drawings. Van Goethem and Verbeek measure the structural difference between the two drawings in terms of the so-called spirality (Forumala Presented). and describe a morph from (Forumala Presented). using O(s) linear morphs. We prove that linear morphs are always sufficient to morph between two planar orthogonal drawings, even for disconnected graphs. The resulting morphs are quite natural and visually pleasing.

Originele taal-2Engels
TitelGraph Drawing and Network Visualization - 27th International Symposium, GD 2019, Proceedings
RedacteurenDaniel Archambault, Csaba D. Tóth
Plaats van productieCham
UitgeverijSpringer
Pagina's33-45
Aantal pagina's13
ISBN van elektronische versie978-3-030-35802-0
ISBN van geprinte versie978-3-030-35801-3
DOI's
StatusGepubliceerd - 28 nov 2019
Evenement27th International Symposium on Graph Drawing and Network Visualization, GD 2019 - Prague, Tsjechië
Duur: 17 sep 201920 sep 2019

Publicatie series

NaamLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11904 LNCS
ISSN van geprinte versie0302-9743
ISSN van elektronische versie1611-3349

Congres

Congres27th International Symposium on Graph Drawing and Network Visualization, GD 2019
Land/RegioTsjechië
StadPrague
Periode17/09/1920/09/19

Vingerafdruk

Duik in de onderzoeksthema's van 'Optimal morphs of planar orthogonal drawings II'. Samen vormen ze een unieke vingerafdruk.

Citeer dit