Geodesic
Simultaneous Drawing of Planar Graphs with Right-Angle Crossings and Few Bends
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the Ninth International Workshop on Algorithms and Computation (WALCOM 2015) , Tome 20 (2016) no. 1, pp. 133-158.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is a drawing of the two graphs where each graph is drawn planar, no two edges overlap, and edges of one graph can cross edges of the other graph only at right angles. In the geometric version of the problem, vertices are drawn as points and edges as straight-line segments. It is known, however, that even pairs of very simple classes of planar graphs (such as wheels and matchings) do not always admit a geometric RAC simultaneous drawing. In order to enlarge the class of graphs that admit RAC simultaneous drawings, we allow edges to have bends. We prove that any pair of planar graphs admits a RAC simultaneous drawing with at most six bends per edge. For more restricted classes of planar graphs (e.g., matchings, paths, cycles, outerplanar graphs, and subhamiltonian graphs), we significantly reduce the required number of bends per edge. All our drawings use quadratic area. 
@article{JGAA_2016_20_1_a7,
     author = {Michael Bekos and Thomas van Dijk and Philipp Kindermann and Alexander Wolff},
     title = {Simultaneous {Drawing} of {Planar} {Graphs} {with
Right-Angle} {Crossings} and {Few} {Bends}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {133--158},
     publisher = {mathdoc},
     volume = {20},
     number = {1},
     year = {2016},
     doi = {10.7155/jgaa.00388},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00388/}
}
TY  - JOUR
AU  - Michael Bekos
AU  - Thomas van Dijk
AU  - Philipp Kindermann
AU  - Alexander Wolff
TI  - Simultaneous Drawing of Planar Graphs with
Right-Angle Crossings and Few Bends
JO  - Journal of Graph Algorithms and Applications
PY  - 2016
SP  - 133
EP  - 158
VL  - 20
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00388/
DO  - 10.7155/jgaa.00388
LA  - en
ID  - JGAA_2016_20_1_a7
ER  - 
%0 Journal Article
%A Michael Bekos
%A Thomas van Dijk
%A Philipp Kindermann
%A Alexander Wolff
%T Simultaneous Drawing of Planar Graphs with
Right-Angle Crossings and Few Bends
%J Journal of Graph Algorithms and Applications
%D 2016
%P 133-158
%V 20
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00388/
%R 10.7155/jgaa.00388
%G en
%F JGAA_2016_20_1_a7
Michael Bekos; Thomas van Dijk; Philipp Kindermann; Alexander Wolff. Simultaneous Drawing of Planar Graphs with
Right-Angle Crossings and Few Bends. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the Ninth International Workshop on Algorithms and Computation  (WALCOM 2015)
					, Tome 20 (2016) no. 1, pp. 133-158. doi : 10.7155/jgaa.00388. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00388/

Cité par Sources :