On the Total Number of Bends for Planar Octilinear Drawings

An octilinear drawing of a planar graph is one in which each edge is drawn as a sequence of horizontal, vertical and diagonal at \(45^\circ \) line-segments. For such drawings to be readable, special care is needed in order to keep the number of bends small. As the problem of finding planar octilinear drawings of minimum number of bends is NP-hard, in this paper we focus on upper and lower bounds. From a recent result of Keszegh et al. on the slope number of planar graphs, we can derive an upper bound of \(4n-10\) bends for 8-planar graphs with n vertices. We considerably improve this general bound and corresponding previous ones for triconnected 4-, 5- and 6-planar graphs. We also derive non-trivial lower bounds for these three classes of graphs by a technique inspired by the network flow formulation of Tamassia.

[1]  Ulrik Brandes,et al.  More Canonical Ordering , 2011, J. Graph Algorithms Appl..

[2]  Yanpei Liu,et al.  A Linear Algorithm for 2-bend Embeddings of Planar Graphs in the Two-dimensional Grid , 1998, Discret. Appl. Math..

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

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

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

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

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

[8]  Balázs Keszegh,et al.  Drawing Planar Graphs of Bounded Degree with Few Slopes , 2013, SIAM J. Discret. Math..

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

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

[11]  Stefan Felsner.  Schnyder Woods or How to Draw a Planar Graph , 2004 .

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

[13]  Martin Nöllenburg,et al.  Automated Drawings of Metro Maps 1 , 2005 .

[14]  Therese C. Biedl.  New Lower Bounds for Orthogonal Graph Drawings , 1995, Graph Drawing.

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

[16]  Michael Kaufmann,et al.  On Improving Orthogonal Drawings: The 4M-Algorithm , 1998, GD.

[17]  Michael A. Bekos,et al.  Planar Octilinear Drawings with One Bend Per Edge , 2015 .

[18]  Michael A. Bekos,et al.  On the Total Number of Bends for Planar Octilinear Drawings , 2017, J. Graph Algorithms Appl..

[19]  Ioannis G. Tollis,et al.  Lower Bounds for Planar Orthogonal Drawings of Graphs , 1991, Inf. Process. Lett..

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

[21]  János Pach,et al.  How to draw a planar graph on a grid , 1990, Comb..