Planar rectilinear drawings of outerplanar graphs in linear time

We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding that the drawing has to respect and if it does not. Our algorithm returns a planar rectilinear drawing if the graph admits one.

Uložené v:
Podrobná bibliografia
Vydané v:Computational geometry : theory and applications Ročník 103; s. 101854
Hlavný autor: Frati, Fabrizio
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.04.2022
Predmet:
Linear-time algorithm
Outerplanar graphs
Planarity
Rectilinear drawing
Rectilinear drawing
Outerplanar graphs
Planarity
Linear-time algorithm
ISSN:0925-7721
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:We show how to test in linear time whether an outerplanar graph admits a planar rectilinear drawing, both if the graph has a prescribed plane embedding that the drawing has to respect and if it does not. Our algorithm returns a planar rectilinear drawing if the graph admits one.
ISSN:0925-7721
DOI:10.1016/j.comgeo.2021.101854