%0 Conference Paper %1 bdkw-sdrac-14 %A Bekos, Michael A. %A van Dijk, Thomas C. %A Kindermann, Philipp %A Wolff, Alexander %B Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM'15) %D 2015 %E Rahman, M.S. %E Tomita, E. %I Springer-Verlag %K myown %P 222--233 %R 10.1007/978-3-319-15612-5_20 %T Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends %V 8973 %X Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is one in which each graph is drawn planar, there are no edge overlaps and the crossings between the two graphs form right angles. The geometric version restricts the problem to straight-line drawings. It is known, however, that there exists a wheel and a matching which do not admit a geometric RAC simultaneous drawing. In order to enlarge the class of graphs that admit RAC simultaneous drawings, we allow bends in the resulting drawings. We prove that two planar graphs always admit a RAC simultaneous drawing with six bends per edge each, in quadratic area. For more restricted classes of planar graphs (i.e., matchings, paths, cycles, outerplanar graphs and subhamiltonian graphs), we manage to significantly reduce the required number of bends per edge, while keeping the area quadratic.

@inproceedings{bdkw-sdrac-14, abstract = {Given two planar graphs that are defined on the same set of vertices, \emph{a RAC simultaneous drawing} is one in which each graph is drawn planar, there are no edge overlaps and the crossings between the two graphs form right angles. The geometric version restricts the problem to straight-line drawings. It is known, however, that there exists a wheel and a matching which do not admit a geometric RAC simultaneous drawing. In order to enlarge the class of graphs that admit RAC simultaneous drawings, we allow bends in the resulting drawings. We prove that two planar graphs always admit a RAC simultaneous drawing with six bends per edge each, in quadratic area. For more restricted classes of planar graphs (i.e., matchings, paths, cycles, outerplanar graphs and subhamiltonian graphs), we manage to significantly reduce the required number of bends per edge, while keeping the area quadratic.}, added-at = {2014-07-10T15:42:14.000+0200}, arxiv = {https://arxiv.org/abs/1408.3325}, author = {Bekos, Michael A. and van Dijk, Thomas C. and Kindermann, Philipp and Wolff, Alexander}, biburl = {https://www.bibsonomy.org/bibtex/290fe501e5459bcc35253f8cf960f7674/kindermann}, booktitle = {Proceedings of the 9th International Workshop on Algorithms and Computation (WALCOM'15)}, doi = {10.1007/978-3-319-15612-5_20}, editor = {Rahman, M.S. and Tomita, E.}, interhash = {d4d660bd72ef0eb3f9c8de0da8d40b03}, intrahash = {90fe501e5459bcc35253f8cf960f7674}, keywords = {myown}, month = feb, pages = {222--233}, publisher = {Springer-Verlag}, series = {Lecture Notes in Computer Science}, slides = {http://www1.pub.informatik.uni-wuerzburg.de/pub/kindermann/slides/2014-walcom-racsim.pdf}, timestamp = {2018-09-18T06:22:04.000+0200}, title = {Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends}, volume = 8973, year = 2015 }