Planar Octilinear Drawings with One Bend Per Edge

In octilinear drawings of planar graphs, every edge is drawn as an alternating sequence of horizontal, vertical and diagonal line-segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A k-planar graph is a planar graph in which each vertex has degree less or equal to k. In particular, we prove that every 4-planar graph admits a planar octilinear drawing with at most one bend per edge on an integer grid of size On 2 ×On. For 5-planar graphs, we prove that one bend per edge still suffices in order to construct planar octilinear drawings, but in super-polynomial area. However, for 6-planar graphs we give a class of graphs whose planar octilinear drawings require at least two bends per edge.

[1]  Goos Kant.  Hexagonal Grid Drawings , 1992, WG.

[2]  Goos Kant,et al.  A Better Heuristic for Orthogonal Graph Drawings , 1994, ESA.

[3]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[4]  Ignaz Rutter,et al.  Orthogonal Graph Drawing with Flexibility Constraints , 2010, Algorithmica.

[5]  Alexander Wolff,et al.  Drawing and Labeling High-Quality Metro Maps by Mixed-Integer Programming , 2011, IEEE Transactions on Visualization and Computer Graphics.

[6]  Giuseppe Liotta,et al.  Planar and Plane Slope Number of Partial 2-Trees , 2013, Graph Drawing.

[7]  Seok-Hee Hong,et al.  Automatic visualisation of metro maps , 2006, J. Vis. Lang. Comput..

[8]  Gerard Tel,et al.  Journal of Graph Algorithms and Applications a Note on Rectilinearity and Angular Resolution , 2022 .

[9]  Emilio Di Giacomo,et al.  The Planar Slope Number of Subcubic Graphs , 2014, LATIN.

[10]  Balázs Keszegh,et al.  Drawing Planar Graphs of Bounded Degree with Few Slopes , 2010, Graph Drawing.

[11]  Goos Kant.  Drawing Planar Graphs Using the lmc-Ordering (Extended Abstract) , 1992, FOCS 1992.

[12]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[13]  Goos Kant,et al.  Drawing planar graphs using the lmc-ordering , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[14]  Alexander Wolff,et al.  Graph Drawing and Cartography , 2013, Handbook of Graph Drawing and Visualization.

[15]  Dömötör Pálvölgyi,et al.  Drawing cubic graphs with the four basic slopes , 2011, Graph Drawing.

[16]  Stephen G. Walker,et al.  Automatic Metro Map Layout Using Multicriteria Optimization , 2011, IEEE Transactions on Visualization and Computer Graphics.

[17]  Balázs Keszegh,et al.  Drawing Cubic Graphs with at Most Five Slopes , 2006, Graph Drawing.

[18]  Petra Mutzel,et al.  A Linear Time Implementation of SPQR-Trees , 2000, GD.

[19]  Roberto Tamassia,et al.  On-Line Graph Algorithms with SPQR-Trees , 1990, ICALP.

[20]  Jan Kratochvíl,et al.  The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree , 2013, Graphs Comb..