Combining Problems on RAC Drawings and Simultaneous Graph Drawings

Argyriou, Evmorfia N. and Bekos, Michael A. and Kaufmann, Michael and Symvonis, Antonios (2012) Combining Problems on RAC Drawings and Simultaneous Graph Drawings. In: Graph Drawing 19th International Symposium, GD 2011, September 21-23, 2011 , pp. 433-434(Official URL: http://dx.doi.org/10.1007/978-3-642-25878-7_41).

Full text not available from this repository.

Abstract

We present an overview of the first combinatorial results for the so-called geometric RAC simultaneous drawing problem (or GRacSim drawing problem, for short), i.e., a combination of problems on geometric RAC drawings [3] and geometric simultaneous graph drawings [2]. According to this problem, we are given two planar graphs G 1 = (V, E 1) and G 2 = (V, E 2) that share a common vertex set but have disjoint edge sets, i.e., E 1 ⊆ V ×V , E 2 ⊆ V ×V and E 1 ∩ E 2 = ∅ The main task is to place the vertices on the plane so that, when the edges are drawn as straight-lines, (i) each graph is drawn planar, (ii) there are no edge overlaps, and, (iii) crossings between edges in E 1 and E 2 occur at right angles.

Item Type: Conference Paper
Additional Information: 10.1007/978-3-642-25878-7_41
Classifications: G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.490 Embeddings
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1276

Actions (login required)

View Item View Item