Aligned Drawings of Planar Graphs

Let $G$ be a graph that is topologically embedded in the plane and let $\mathcal A$ be an arrangement of pseudolines intersecting the drawing of $G$. An aligned drawing of $G$ and $\mathcal A$ is a planar polyline drawing $\Gamma$ of $G$ with an arrangement $A$ of lines so that $\Gamma$ and $A$ are...

Full description

Saved in:
Bibliographic Details
Published inJournal of graph algorithms and applications Vol. 22; no. 3; pp. 401 - 429
Main Authors Mchedlidze, Tamara, Radermacher, Marcel, Rutter, Ignaz
Format Journal Article
LanguageEnglish
Published 01.09.2018
Online AccessGet full text

Cover

Loading…
Abstract Let $G$ be a graph that is topologically embedded in the plane and let $\mathcal A$ be an arrangement of pseudolines intersecting the drawing of $G$. An aligned drawing of $G$ and $\mathcal A$ is a planar polyline drawing $\Gamma$ of $G$ with an arrangement $A$ of lines so that $\Gamma$ and $A$ are homeomorphic to $G$ and $\mathcal A$. We show that if $\mathcal A$ is stretchable and every edge $e$ either entirely lies on a pseudoline or it has at most one intersection with $\mathcal A$, then $G$ and $\mathcal A$ have a straight-line aligned drawing. In order to prove this result, we strengthen a result of Da Lozzo et al. [Da Lozzo et al. GD 2016], and prove that a planar graph $G$ and a single pseudoline $\mathcal L$ have an aligned drawing with a prescribed convex drawing of the outer face. We also study the less restrictive version of the alignment problem with respect to one line, where only a set of vertices is given and we need to determine whether they can be collinear. We show that the problem is $\mathcal{NP}$-complete but fixed-parameter tractable.
AbstractList Let $G$ be a graph that is topologically embedded in the plane and let $\mathcal A$ be an arrangement of pseudolines intersecting the drawing of $G$. An aligned drawing of $G$ and $\mathcal A$ is a planar polyline drawing $\Gamma$ of $G$ with an arrangement $A$ of lines so that $\Gamma$ and $A$ are homeomorphic to $G$ and $\mathcal A$. We show that if $\mathcal A$ is stretchable and every edge $e$ either entirely lies on a pseudoline or it has at most one intersection with $\mathcal A$, then $G$ and $\mathcal A$ have a straight-line aligned drawing. In order to prove this result, we strengthen a result of Da Lozzo et al. [Da Lozzo et al. GD 2016], and prove that a planar graph $G$ and a single pseudoline $\mathcal L$ have an aligned drawing with a prescribed convex drawing of the outer face. We also study the less restrictive version of the alignment problem with respect to one line, where only a set of vertices is given and we need to determine whether they can be collinear. We show that the problem is $\mathcal{NP}$-complete but fixed-parameter tractable.
Author Rutter, Ignaz
Mchedlidze, Tamara
Radermacher, Marcel
Author_xml – sequence: 1
  givenname: Tamara
  surname: Mchedlidze
  fullname: Mchedlidze, Tamara
– sequence: 2
  givenname: Marcel
  surname: Radermacher
  fullname: Radermacher, Marcel
– sequence: 3
  givenname: Ignaz
  surname: Rutter
  fullname: Rutter, Ignaz
BookMark eNpNz71OwzAUBWALFYm2sPAEYUVK6-ufxB6rAqVSJRhgtm5t35AqOJU9IN4eCgxM50xH55uxSRpTZOwa-KIFrZeHDnHBuWr1GZuCFk0NLdjJv37BZqUcOBdStGbKblZD36UYqruMH33qSjVS9TxgwlxtMh7fyiU7JxxKvPrLOXt9uH9ZP9a7p812vdrVHozQNXFSSFp6D5L7xghJEaJUViGEJjZ7E5SNinxUaPchKqOA5PfpQNwLYeWc3f7u-jyWkiO5Y-7fMX864O6Ecyec-8HJL3cgQt4
CitedBy_id crossref_primary_10_1016_j_comgeo_2021_101843
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.7155/jgaa.00475
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1526-1719
EndPage 429
ExternalDocumentID 10_7155_jgaa_00475
GroupedDBID -~9
29K
2WC
5GY
AAFWJ
AAKPC
AAYXX
ACGFO
ACIPV
AFPKN
ALMA_UNASSIGNED_HOLDINGS
CITATION
D-I
E3Z
EBS
EJD
F5P
GROUPED_DOAJ
M~E
OK1
P2P
REM
RNS
TR2
XSB
ID FETCH-LOGICAL-c1825-f0f4af53cc130c6823fe1e3494a1d6e6b8d49e4fce4a9bde4841f3715df0c2293
ISSN 1526-1719
IngestDate Wed Oct 02 14:46:15 EDT 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c1825-f0f4af53cc130c6823fe1e3494a1d6e6b8d49e4fce4a9bde4841f3715df0c2293
OpenAccessLink https://doi.org/10.7155/jgaa.00475
PageCount 29
ParticipantIDs crossref_primary_10_7155_jgaa_00475
PublicationCentury 2000
PublicationDate 2018-09-01
PublicationDateYYYYMMDD 2018-09-01
PublicationDate_xml – month: 09
  year: 2018
  text: 2018-09-01
  day: 01
PublicationDecade 2010
PublicationTitle Journal of graph algorithms and applications
PublicationYear 2018
SSID ssj0023278
Score 2.1855721
Snippet Let $G$ be a graph that is topologically embedded in the plane and let $\mathcal A$ be an arrangement of pseudolines intersecting the drawing of $G$. An...
SourceID crossref
SourceType Aggregation Database
StartPage 401
Title Aligned Drawings of Planar Graphs
Volume 22
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3Pa9swFBZpdmkPo1s39qMtLu0tuI1l2VKOpe1WCumhJNBbeNaPNJA4w3UY5LC_fU-Wo5g2g6wXY4Qly_7E956enj4RctblwCUatpDyxIQszlgIiH1INVNobrOUSxuH7N-nt0N295g8tlp3jaylRZmdy-XGfSVvQRXLEFe7S_Y_kPWNYgHeI754RYTxuhXGl9PJGGmyc13A7-r4TZvQNoUcis5PK0T9_A_Xs1Kp7sB0PC8m5dPMyTQ3l7LX0bonraYTtXTavDCDwtP4g82BnsEK9L7dNOnTNR6q868rAhrnsGzGFiLhk6c8HdI0jHhNanpDWc2hlDbGStwgRFY352wrc9GNl7TN0amxtD0GOLfylcnaOK0W5F_YLJ9JiHMYW3tk646qujvkHeW9xE7E-39u_OQ7ppVV9r13UrW27sX6vQ3npOFlDPbJ-xqj4NJh_YG0dP6R7PW9tu7zATmpUQ9WqAdzEzjUA4f6JzL8cTO4ug3rgy5CidO7JDRdw8AksZToUchU0NjoSFvhIIhUqtNMKNbTzEjNoJcpzQSLTIx9V6YrKTpsn0k7n-f6CwkSweMYIi4UpEwoI4QWNtFXZMYmNEZfyenqC0e_nJ7J6PU__LbVU9_J7nrQHJJ2WSz0EbpoZXZchTaOKwT-AlfZPWA
link.rule.ids 315,786,790,870,27957,27958
linkProvider ISSN International Centre
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=Aligned+Drawings+of+Planar+Graphs&rft.jtitle=Journal+of+graph+algorithms+and+applications&rft.au=Mchedlidze%2C+Tamara&rft.au=Radermacher%2C+Marcel&rft.au=Rutter%2C+Ignaz&rft.date=2018-09-01&rft.issn=1526-1719&rft.eissn=1526-1719&rft.volume=22&rft.issue=3&rft.spage=401&rft.epage=429&rft_id=info:doi/10.7155%2Fjgaa.00475&rft.externalDBID=n%2Fa&rft.externalDocID=10_7155_jgaa_00475
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1526-1719&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1526-1719&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1526-1719&client=summon