Abstract
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.
Chapter PDF
References
Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph drawing. Prentice-Hall, Englewood Cliffs (1999)
Batagelj, V., Kerzic, D., Pisanski, T.: Automatic clustering of languages. Computational Linguistics 18(3), 339–352 (1992)
Dahlhaus, E.: Linear time algorithm to recognize clustered planar graphs and its parallelization. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 239–248. Springer, Heidelberg (1998)
Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Planarity-preserving clustering and embedding for large planar graphs. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 186–196. Springer, Heidelberg (1999)
Eades, P., Feng, Q.-W., Nagamochi, H.: Drawing clustered graphs on an orthogonal grid. Journal of Graph Algorithms and Application 3(4), 3–29 (1999)
Eades, P., Feng, Q.-W.: Drawing clustered graphs on orthogonal grid. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 146–157. Springer, Heidelberg (1997)
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)
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)
Godehardt, E.: Graphs as Structural Models, Advances in System Analysis, vol. 4. Vieweg (1998)
Gutwenger, C., Jünger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Advances in c-planarity testing of clustered graphs (extended abstract). In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 220–235. Springer, Heidelberg (2002)
Harel, D., Tarjan, R.: Fast algorithms for finding nearest common ancestors. SIAM J. Computing 13, 338–355 (1984)
Kaufmann, M., Wagner, D.: Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001)
Nishizeki, T., Chiba, N.: Planar Graphs: Theory and Algorithms, North-Holland Mathematics Studies 140/32 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagamochi, H., Kuroya, K. (2004). Convex Drawing for c-Planar Biconnected Clustered Graphs. In: Liotta, G. (eds) Graph Drawing. GD 2003. Lecture Notes in Computer Science, vol 2912. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24595-7_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-24595-7_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20831-0
Online ISBN: 978-3-540-24595-7
eBook Packages: Springer Book Archive