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.

Saved in:
Bibliographic Details
Published in:Computational geometry : theory and applications Vol. 103; p. 101854
Main Author: Frati, Fabrizio
Format: Journal Article
Language:English
Published: Elsevier B.V 01.04.2022
Subjects:
Linear-time algorithm
Outerplanar graphs
Planarity
Rectilinear drawing
Rectilinear drawing
Outerplanar graphs
Planarity
Linear-time algorithm
ISSN:0925-7721
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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