Smooth Orthogonal Drawings of Planar Graphs
In smooth orthogonal layouts of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axis-aligned tangents. In this paper, we study the problem of finding smooth orthogonal layouts of low edge complexity, that is, with few segments per edge. We say that a graph has smooth complexity k—for short, an SC k -layout—if it admits a smooth orthogonal drawing of edge complexity at most k.
Our main result is that every 4-planar graph has an SC2-layout. While our drawings may have super-polynomial area, we show that for 3-planar graphs, cubic area suffices. We also show that any biconnected 4-outerplane graph has an SC1-layout. On the negative side, we demonstrate an infinite family of biconnected 4-planar graphs that require exponential area for an SC1-layout. Finally, we present an infinite family of biconnected 4-planar graphs that do not admit an SC1-layout.
KeywordsOuter Face Horizontal Segment Biconnected Component Edge Complexity Free Port
Unable to display preview. Download preview PDF.
- 1.Alam, M.J., Bekos, M.A., Kaufmann, M., Kindermann, P., Kobourov, S.G., Wolff, A.: Smooth orthogonal drawings of planar graphs. Arxiv report arxiv.org/abs/1312.3538 (2013)Google Scholar
- 8.Leiserson, C.E.: Area-efficient graph layouts (for VLSI). In: Proc. 21st Annu. IEEE Symp. Foundat. Comput. Sci. (FOCS 1980), pp. 270–281 (1980)Google Scholar
- 12.Waldherr, H.: Network Gmunden–Vöcklabruck–Salzkammergut of the Publ. Transp. Assoc. OÖVG, Austria (November 2012), http://www.ooevv.at/uploads/media/OOE2_Salzkammergut_V17_END.pdf (accessed September 10, 2013)