Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time
Abstract
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.
 Publication:

arXiv eprints
 Pub Date:
 June 2020
 DOI:
 10.48550/arXiv.2006.06951
 arXiv:
 arXiv:2006.06951
 Bibcode:
 2020arXiv200606951F
 Keywords:

 Computer Science  Data Structures and Algorithms;
 Computer Science  Computational Geometry;
 Computer Science  Discrete Mathematics
 EPrint:
 Appears in the Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020)