Geometric RAC Simultaneous Drawings of Graphs

In this paper, we study the geometric RAC simultaneous drawing problem: Given two planar graphs that share a common vertex set but have disjoint edge sets, a geometric RAC simultaneous drawing is a straight-line drawing in which (i) each graph is drawn planar, (ii) there are no edge overlaps, and, (iii) crossings between edges of the two graphs occur at right-angles. We first prove that two planar graphs admitting a geometric simultaneous drawing may not admit a geometric RAC simultaneous drawing. We further show that a cycle and a matching always admit a geometric RAC simultaneous drawing, which can be constructed in linear time. We also study a closely related problem according to which we are given a planar embedded graph G and the main goal is to determine a geometric drawing of G and its dual G∗ (without the face-vertex corresponding to the external face) such that: (i) G and G∗ are drawn planar, (ii) each vertex of the dual is drawn inside its corresponding face of G and, (iii) the primal-dual edge crossings form right-angles. We prove that it is always possible to construct such a drawing if the input graph is an outerplanar embedded graph.

[1]  Michael A. Bekos,et al.  The Straight-Line RAC Drawing Problem is NP-Hard , 2010, J. Graph Algorithms Appl..

[2]  Michael Kaufmann,et al.  Two Trees Which Are Self-intersecting When Drawn Simultaneously , 2005, Graph Drawing.

[3]  Csaba D. Tóth,et al.  Graphs that admit right angle crossing drawings , 2010, Comput. Geom..

[4]  Michael Kaufmann,et al.  Constrained Simultaneous and Near-Simultaneous Embeddings , 2007, J. Graph Algorithms Appl..

[5]  Michael Jünger,et al.  Simultaneous Geometric Graph Embeddings , 2007, GD.

[6]  Emilio Di Giacomo,et al.  Area, Curve Complexity, and Crossing Resolution of Non-Planar Graph Drawings , 2010, Theory of Computing Systems.

[7]  Graham R. Brightwell,et al.  Representations of Planar Graphs , 1993, SIAM J. Discret. Math..

[8]  Walter Didimo,et al.  Drawing graphs with right angle crossings , 2009, Theor. Comput. Sci..

[9]  Michael Kaufmann,et al.  On a Tree and a Path with no Geometric Simultaneous Embedding , 2010, J. Graph Algorithms Appl..

[10]  Giuseppe Liotta,et al.  Right angle crossing graphs and 1-planarity , 2011, Discret. Appl. Math..

[11]  Stephen G. Kobourov,et al.  Simultaneous Embedding of Planar Graphs with Few Bends , 2004, Graph Drawing.

[12]  Peter Eades,et al.  Effects of Crossing Angles , 2008, 2008 IEEE Pacific Visualization Symposium.

[13]  Joseph S. B. Mitchell,et al.  On Simultaneous Planar Graph Embeddings , 2003, WADS.

[14]  Michael Kaufmann,et al.  On the Perspectives Opened by Right Angle Crossing Drawings , 2009, J. Graph Algorithms Appl..

[15]  Marc J. van Kreveld,et al.  The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs , 2010, GD.

[16]  Walter Didimo,et al.  A characterization of complete bipartite RAC graphs , 2010, Inf. Process. Lett..

[17]  Stephen G. Kobourov,et al.  Simultaneous Embedding of a Planar Graph and Its Dual on the Grid , 2005, Theory of Computing Systems.