Simultaneous Embedding

2020 ◽  
pp. 237-265
Author(s):  
Ignaz Rutter
2005 ◽  
Vol 9 (3) ◽  
pp. 347-364 ◽  
Author(s):  
Cesim Erten ◽  
Stephen G. Kobourov

Author(s):  
J. Joseph Fowler ◽  
Carsten Gutwenger ◽  
Michael Jünger ◽  
Petra Mutzel ◽  
Michael Schulz

Author(s):  
Patrizio Angelini ◽  
Markus Geyer ◽  
Michael Kaufmann ◽  
Daniel Neuwirth

2005 ◽  
Vol 38 (3) ◽  
pp. 313-327 ◽  
Author(s):  
Cesim Erten ◽  
Stephen G. Kobourov

Algorithmica ◽  
2017 ◽  
Vol 80 (4) ◽  
pp. 1214-1277 ◽  
Author(s):  
Thomas Bläsius ◽  
Annette Karrer ◽  
Ignaz Rutter

2007 ◽  
Vol 17 (02) ◽  
pp. 139-160 ◽  
Author(s):  
EMILIO DI GIACOMO ◽  
GIUSEPPE LIOTTA

Let G1 and G2 be two planar graphs having some vertices in common. A simultaneous embedding of G1 and G2 is a pair of crossing-free drawings of G1 and G2 such that each vertex in common is represented by the same point in both drawings. In this paper we show that an outerplanar graph and a simple path can be simultaneously embedded with fixed edges such that the edges in common are straight-line segments while the other edges of the outerplanar graph can have at most one bend per edge. We then exploit the technique for outerplanar graphs and paths to study simultaneous embeddings of other pairs of graphs. Namely, we study simultaneous embedding with fixed edges of: (i) two outerplanar graphs sharing a forest of paths and (ii) an outerplanar graph and a cycle.


Sign in / Sign up

Export Citation Format

Share Document