A Universal Slope Set for 1-Bend Planar Drawings

We describe a set of Delta-1 slopes that are universal for 1-bend planar drawings of planar graphs of maximum degree Delta>=4; this establishes a new upper bound of Delta-1 on the 1-bend planar slope number. By universal we mean that every planar graph of degree Delta has a planar drawing with at most one bend per edge and such that the slopes of the segments forming the edges belong to the given set of slopes. This improves over previous results in two ways: Firstly, the best previously known upper bound for the 1-bend planar slope number was 3/2(Delta-1) (the known lower bound being 3/4(Delta-1)); secondly, all the known algorithms to construct 1-bend planar drawings with O(Delta) slopes use a different set of slopes for each graph and can have bad angular resolution, while our algorithm uses a universal set of slopes, which also guarantees that the minimum angle between any two edges incident to a vertex is pi/(Delta-1).

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

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

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

[4]  Bartosz Walczak,et al.  Graph Drawings with One Bend and Few Slopes , 2016, LATIN.

[5]  Michael A. Bekos,et al.  On the Total Number of Bends for Planar Octilinear Drawings , 2016, LATIN.

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

[7]  Patrice Ossona de Mendez,et al.  On Triangle Contact Graphs , 1994, Combinatorics, Probability and Computing.

[8]  Gerhard J. Woeginger,et al.  Drawing graphs in the plane with high resolution , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

[10]  F. Leighton,et al.  Drawing Planar Graphs Using the Canonical Ordering , 1996 .

[11]  Petra Mutzel,et al.  Planar Polyline Drawings with Good Angular Resolution , 1998, GD.

[12]  Jan Kratochvíl,et al.  The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree , 2009, Graph Drawing.

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

[14]  Emilio Di Giacomo,et al.  Drawing Outer 1-planar Graphs with Few Slopes , 2015, J. Graph Algorithms Appl..

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

[16]  David Eppstein,et al.  Drawing Trees with Perfect Angular Resolution and Polynomial Area , 2013, Discret. Comput. Geom..

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

[18]  Stephen G. Kobourov,et al.  Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution , 2001, Graph Drawing.

[19]  Ignaz Rutter,et al.  Orthogonal graph drawing with inflexible edges , 2016, Comput. Geom..

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

[21]  Goos Kant,et al.  A better heuristic for orthogonal graph drawings , 1998, Comput. Geom..

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

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

[24]  David Eppstein,et al.  Drawings of planar graphs with few slopes and segments , 2007, Comput. Geom..

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

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

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

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

[29]  Stephane Durocher,et al.  Trade-Offs in Planar Polyline Drawings , 2014, Graph Drawing.

[30]  Piotr Micek,et al.  Outerplanar Graph Drawings with Few Slopes , 2012, COCOON.

[31]  Jirí Matousek,et al.  Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness , 2006, Electron. J. Comb..

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

[33]  Roberto Tamassia,et al.  Planar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract) , 1994, ESA.

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

[35]  Michael A. Bekos,et al.  Planar Octilinear Drawings with One Bend Per Edge , 2014, Graph Drawing.

[36]  Peter Robinson,et al.  Drawability of Complete Graphs Using a Minimal Slope Set , 1994, Comput. J..

[37]  Nicolas Bonichon,et al.  Optimal Area Algorithm for Planar Polyline Drawings , 2002, WG.

[38]  Udo Hoffmann,et al.  On the Complexity of the Planar Slope Number Problem , 2017, J. Graph Algorithms Appl..

[39]  Michael A. Bekos,et al.  Universal Slope Sets for 1-Bend Planar Drawings , 2019, Algorithmica.