Convex Drawing for c-Planar Biconnected Clustered Graphs
In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph is a graph with a set of non-intersecting clusters. In this paper, we assume that the graph is planar, each non leaf cluster has exactly two child clusters in the tree representation of non-intersecting clusters, and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight line segments with no crossing between two edges, and (ii) the boundary of the biconnected subgraph induced by each cluster is convex polygon.
- 2.Batagelj, V., Kerzic, D., Pisanski, T.: Automatic clustering of languages. Computational Linguistics 18(3), 339–352 (1992)Google Scholar
- 7.Eades, P., Feng, Q.-W., Lin, X., Nagamochi, H.: Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Technical Report Newcastle University (submitted to a journal) (1999)Google Scholar
- 8.Feng, Q.-W., Cohen, R.-F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P.G. (ed.) ESA 1995. LNCS, vol. 979, pp. 213–226. Springer, Heidelberg (1995)Google Scholar
- 9.Godehardt, E.: Graphs as Structural Models, Advances in System Analysis, vol. 4. Vieweg (1998)Google Scholar
- 13.Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms, North-Holland Mathematics Studies 140/32 (1988)Google Scholar