On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings

We study two variants of the well-known orthogonal graph drawing model: (1) the smooth orthogonal, and (2) the octilinear. Both models are extensions of the orthogonal one, by supporting one additional type of edge segments (circular arcs and diagonal segments, respectively). For planar graphs of maximum vertex degree 4, we analyze relationships between the graph classes that can be drawn bendless in the two models and we also prove $$\mathcal {NP}$$NP-hardness for a restricted version of the bendless drawing problem for both models. For planar graphs of higher vertex degree, we present an algorithm that produces bi-monotone smooth orthogonal drawings with at most two segments per edge, which also guarantees a linear number of edges with exactly one segment.

[1]  Michael A. Bekos,et al.  Perfect smooth orthogonal drawings , 2014 .

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

[3]  David Eppstein,et al.  Planar Lombardi Drawings for Subcubic Graphs , 2012, GD.

[4]  Jean Cardinal,et al.  Arc Diagrams, Flip Distances, and Hamiltonian Triangulations , 2015, STACS.

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

[6]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

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

[8]  Ján Manuch,et al.  Complexity of Finding Non-Planar Rectilinear Drawings of Graphs , 2010, GD.

[9]  Walter Didimo,et al.  Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size , 1999, GD.

[10]  Michael Kaufmann,et al.  Drawing graphs: methods and models , 2001 .

[11]  Stefan Felsner,et al.  Drawing HV-Restricted Planar Graphs , 2014, LATIN.

[12]  Walter Didimo,et al.  On the Complexity of HV-rectilinear Planarity Testing , 2014, GD.

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

[14]  Roberto Tamassia,et al.  Handbook on Graph Drawing and Visualization , 2013 .

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

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

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

[18]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[19]  Michael Kaufmann,et al.  Drawing High Degree Graphs with Low Bend Numbers , 1995, GD.

[20]  Walter Didimo,et al.  Computing Orthogonal Drawings with the Minimum Number of Bends , 1997, IEEE Trans. Computers.

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

[22]  Michael T. Goodrich,et al.  Planar Orthogonal and Polyline Drawing Algorithms , 2013, Handbook of Graph Drawing and Visualization.

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

[24]  Marek Chrobak,et al.  A Linear-Time Algorithm for Drawing a Planar Graph on a Grid , 1995, Inf. Process. Lett..

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

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

[27]  Martin Nöllenburg,et al.  Automated drawing of metro maps , 2005 .

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

[29]  Frank Harary,et al.  Graph Theory , 2016 .

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

[31]  Michael A. Bekos,et al.  On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings , 2017, Graph Drawing.

[32]  Michael J. Pelsmajer,et al.  Hanani-Tutte and Monotone Drawings , 2011, WG.

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

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

[35]  Michael A. Bekos,et al.  Smooth Orthogonal Layouts , 2012, Graph Drawing.

[36]  Michael A. Bekos,et al.  Smooth Orthogonal Drawings of Planar Graphs , 2014 .

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

[38]  Stefan Felsner,et al.  Geometric Graphs and Arrangements , 2004 .