Multilevel Drawings of Clustered Graphs
The cluster adjacency graph of a flat clustered graph C(G,T) is the graph A whose vertices are the clusters in T and whose edges connect clusters containing vertices that are adjacent in G. A multilevel drawing of a clustered graph C consists of a straight-line c-planar drawing of C in which the clusters are drawn as convex regions and of a straight-line planar drawing of A such that each vertex a ∈ A is drawn in the cluster corresponding to a and such that no edge (a 1,a 2) ∈ A intersects any cluster different from a 1 and a 2. In this paper, we show that every c-planar flat clustered graph admits a multilevel drawing.
KeywordsExtension Region Common Neighbor Internal Vertex Outer Face Convex Region
Unable to display preview. Download preview PDF.
- 7.Feng, Q.: Algorithms for drawing clustered graphs. Ph. D. thesis. The University of Newcastle, Australia (1997)Google Scholar
- 11.Jünger, M., Leipert, S., Percan, M.: Triangulating clustered graphs. Technical report. Zentrum für Angewandte Informatik Köln (2002)Google Scholar