Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings

Ortho-Radial drawings are a generalization of orthogonal drawings to grids that are formed by concentric circles and straight-line spokes emanating from the circles' center. Such drawings have applications in schematic graph layouts, e.g., for metro maps and destination maps. A plane graph is a planar graph with a fixed planar embedding. We give a combinatorial characterization of the plane graphs that admit a planar ortho-radial drawing without bends. Previously, such a characterization was only known for paths, cycles, and theta graphs, and in the special case of rectangular drawings for cubic graphs, where the contour of each face is required to be a rectangle. The characterization is expressed in terms of an ortho-radial representation that, similar to Tamassia's orthogonal representations for orthogonal drawings describes such a drawing combinatorially in terms of angles around vertices and bends on the edges. In this sense our characterization can be seen as a first step towards generalizing the Topology-Shape-Metrics framework of Tamassia to ortho-radial drawings.

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

[2]  Ignaz Rutter,et al.  Optimal Orthogonal Graph Drawing with Convex Bend Costs , 2013, ICALP.

[3]  Sándor P. Fekete,et al.  Orthogonal Graph Drawing , 2001, Drawing Graphs.

[4]  Md. Saidur Rahman,et al.  Orthogonal Drawings of Plane Graphs Without Bends , 2001, J. Graph Algorithms Appl..

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

[6]  Shin-Ichi Nakano,et al.  Rectangular grid drawings of plane graphs , 1998, Comput. Geom..

[7]  Mark de Berg,et al.  Optimal Binary Space Partitions for Segments in the Plane , 2012, Int. J. Comput. Geom. Appl..

[8]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[9]  Ignaz Rutter,et al.  Optimal Orthogonal Graph Drawing with Convex Bend Costs , 2012, ACM Trans. Algorithms.

[10]  Brendan D. McKay,et al.  Rectangular-radial drawings of cubic plane graphs , 2010, Comput. Geom..

[11]  Giuseppe Liotta,et al.  Spirality and Optimal Orthogonal Drawings , 1998, SIAM J. Comput..

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

[13]  Maryam Tahmasbi,et al.  Ortho-radial drawings of graphs , 2009, Australas. J Comb..

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

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

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

[17]  Andreas Karrenbauer,et al.  Journal of Graph Algorithms and Applications Accelerated Bend Minimization , 2022 .

[18]  Shin-Ichi Nakano,et al.  Rectangular grid drawings of plane graphs , 1996, Comput. Geom..

[19]  Ignaz Rutter,et al.  Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model , 2014, ESA.