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.
@article{arxiv.2006.06951,
title = {Planar Rectilinear Drawings of Outerplanar Graphs in Linear Time},
author = {Fabrizio Frati},
journal= {arXiv preprint arXiv:2006.06951},
year = {2020}
}
Comments
Appears in the Proceedings of the 28th International Symposium on Graph Drawing and Network Visualization (GD 2020)