Constrained Simultaneous and Near-Simultaneous Embeddings

A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex sets γ : V1 → V2 is a pair of planar straightline drawings Γ1 of G1 and Γ2 of G2, such that each vertex v2 = γ(v1) is mapped in Γ2 to the same point where v1 is mapped in Γ1, where v1 ∈ V1 and v2 ∈ V2. In this paper we examine several constrained versions of the geometric simultaneous embedding problem as well as a more relaxed version in which instead of exactly simultaneous we look for near-simultaneous embeddings. We show that if the input graphs are assumed to share no common edges this does not seem to yield large classes of graphs that can be simultaneously embedded. Further, we show that if a prescribed combinatorial embedding for each input graph must be preserved, then we can answer some of the problems that are still open for geometric simultaneous embedding. Finally, we present some positive and negative results on the nearsimultaneous embeddi...

• Type: Conference
• Year: 2007
• Where: GD
• Authors: Fabrizio Frati, Michael Kaufmann, Stephen G. Kobourov
• Keywords: Computer Graphics, Embedding Problem, GD 2007, Geometric Simultaneous Embedding, Simultaneous Embedding Problem