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.
Unable to display preview. Download preview PDF.
- 11.Eades, P., Liotta, G.: Right angle crossing graphs and 1-planarity. In: 27th European Workshop on Computational Geometry (2011)Google Scholar
- 17.Huang, W., Hong, S.H., Eades, P.: Effects of crossing angles. In: IEEE Pacific Visualization Symp., pp. 41–46. IEEE (2008)Google Scholar