Optimal morphs of planar orthogonal drawings II

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationGraph Drawing and Network Visualization - 27th International Symposium, GD 2019, Proceedings
EditorsDaniel Archambault, Csaba D. Tóth
Place of PublicationCham
PublisherSpringer
Pages33-45
Number of pages13
ISBN (Electronic)978-3-030-35802-0
ISBN (Print)978-3-030-35801-3
DOIs
Publication statusPublished - 28 Nov 2019
Event27th International Symposium on Graph Drawing and Network Visualization, GD 2019 - Prague, Czech Republic
Duration: 17 Sep 201920 Sep 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11904 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference27th International Symposium on Graph Drawing and Network Visualization, GD 2019
Country/TerritoryCzech Republic
CityPrague
Period17/09/1920/09/19

Fingerprint

Dive into the research topics of 'Optimal morphs of planar orthogonal drawings II'. Together they form a unique fingerprint.

Cite this