Optimal Morphs of Planar Orthogonal Drawings II
Van Goethem and Verbeek recently showed how to morph between two planar orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$ while preserving planarity, orthogonality, and the complexity of the drawing during the morph. Necessarily drawings $\Gamma_I$ and $\Gamma_O$ must be equival...
Saved in:
Main Authors | , , |
---|---|
Format | Journal Article |
Language | English |
Published |
22.08.2019
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Van Goethem and Verbeek recently showed how to morph between two planar
orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$ while
preserving planarity, orthogonality, and the complexity of the drawing during
the morph. Necessarily drawings $\Gamma_I$ and $\Gamma_O$ must be equivalent,
that is, there exists a homeomorphism of the plane that transforms $\Gamma_I$
into $\Gamma_O$. 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 $O(n^{1.5})$ 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 $s = O(n)$ of $\Gamma_I$ relative
to $\Gamma_O$ and describe a morph from $\Gamma_I$ to $\Gamma_O$ using $O(s)$
linear morphs. We prove that $s+1$ 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. |
---|---|
AbstractList | Van Goethem and Verbeek recently showed how to morph between two planar
orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$ while
preserving planarity, orthogonality, and the complexity of the drawing during
the morph. Necessarily drawings $\Gamma_I$ and $\Gamma_O$ must be equivalent,
that is, there exists a homeomorphism of the plane that transforms $\Gamma_I$
into $\Gamma_O$. 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 $O(n^{1.5})$ 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 $s = O(n)$ of $\Gamma_I$ relative
to $\Gamma_O$ and describe a morph from $\Gamma_I$ to $\Gamma_O$ using $O(s)$
linear morphs. We prove that $s+1$ 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. |
Author | van Goethem, Arthur Verbeek, Kevin Speckmann, Bettina |
Author_xml | – sequence: 1 givenname: Arthur surname: van Goethem fullname: van Goethem, Arthur – sequence: 2 givenname: Bettina surname: Speckmann fullname: Speckmann, Bettina – sequence: 3 givenname: Kevin surname: Verbeek fullname: Verbeek, Kevin |
BackLink | https://doi.org/10.48550/arXiv.1908.08365$$DView paper in arXiv |
BookMark | eNotzr1uwjAYhWEPMFDgApjqG0iw4_hvrGgpkajCwB59H04gUrAjB7Xl7stPpzO80tHzQkY--JqQBWdpbqRkS4i_7XfKLTMpM0LJCVmW_aU9Q0e_QuxPAw0N3XXgIdIyXk7hGPytvUf4af1xoEUxI-MGuqGe_--U7Ncf-9Um2Zafxeptm4DSMuFOa8uFRSUz5rSxWSZlzhBFjvxw4DwXTkjUyA2zjXVoFDZCOwVQG6dQTMnr8_Yhrvp4M8ZrdZdXD7n4A9pRPlk |
ContentType | Journal Article |
Copyright | http://creativecommons.org/licenses/by/4.0 |
Copyright_xml | – notice: http://creativecommons.org/licenses/by/4.0 |
DBID | AKY GOX |
DOI | 10.48550/arxiv.1908.08365 |
DatabaseName | arXiv Computer Science arXiv.org |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: GOX name: arXiv.org url: http://arxiv.org/find sourceTypes: Open Access Repository |
DeliveryMethod | fulltext_linktorsrc |
ExternalDocumentID | 1908_08365 |
GroupedDBID | AKY GOX |
ID | FETCH-LOGICAL-a675-1d779139b6520d789225540bb34b1cc1143d35b7b1809f9db86bf37d6aae8d6b3 |
IEDL.DBID | GOX |
IngestDate | Mon Jan 08 05:46:29 EST 2024 |
IsDoiOpenAccess | true |
IsOpenAccess | true |
IsPeerReviewed | false |
IsScholarly | false |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-a675-1d779139b6520d789225540bb34b1cc1143d35b7b1809f9db86bf37d6aae8d6b3 |
OpenAccessLink | https://arxiv.org/abs/1908.08365 |
ParticipantIDs | arxiv_primary_1908_08365 |
PublicationCentury | 2000 |
PublicationDate | 2019-08-22 |
PublicationDateYYYYMMDD | 2019-08-22 |
PublicationDate_xml | – month: 08 year: 2019 text: 2019-08-22 day: 22 |
PublicationDecade | 2010 |
PublicationYear | 2019 |
Score | 1.7384636 |
SecondaryResourceType | preprint |
Snippet | Van Goethem and Verbeek recently showed how to morph between two planar
orthogonal drawings $\Gamma_I$ and $\Gamma_O$ of a connected graph $G$ while
preserving... |
SourceID | arxiv |
SourceType | Open Access Repository |
SubjectTerms | Computer Science - Computational Geometry |
Title | Optimal Morphs of Planar Orthogonal Drawings II |
URI | https://arxiv.org/abs/1908.08365 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwdV09T8MwED21nVgQCFD5lAdW0ya2Y2dEQGmRSpYiZYt8sQMMUJSGj5_POQmChfXs5Wyd37s7-xngPNFaK5tqXmppuaR0jRvnFTelsXRmWgKt0NFd3ifzB3mXq3wA7OctjK2_nj86fWDcTAitzEXQT1ZDGMZxuLJ1m-Vdc7KV4urn_84jjtma_oDEbAe2e3bHLrvt2IWBf92DSUZh-ULm5Zqc2rB1xcJXQbZmWd08rR8DF2bXtf0MRWu2WOzDanazuprz_p8Cbolu88hpHcQ1MVHx1GmTUogQD0IUEqOypIRDOKFQY5DKqlKHJsFKaJdY641LUBzAiFJ9PwZmIivD425KAlDSMPq0FAK9Fw5xaspDGLfeFW-dFEURHC9ax4_-HzqGLYL5NFRC4_gERk397k8JShs8a9fzGyl1coI |
link.rule.ids | 228,230,786,891 |
linkProvider | Cornell University |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimal+Morphs+of+Planar+Orthogonal+Drawings+II&rft.au=van+Goethem%2C+Arthur&rft.au=Speckmann%2C+Bettina&rft.au=Verbeek%2C+Kevin&rft.date=2019-08-22&rft_id=info:doi/10.48550%2Farxiv.1908.08365&rft.externalDocID=1908_08365 |