Abstract
We propose a planarization algorithm for clustered graphs and experimentally test its efficiency and effectiveness. Further, we integrate our planarization strategy into a complete topology-shape-metrics algorithm for drawing clustered graphs in the orthogonal drawing convention.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
AGD. A library of algorithms for graph drawing. Online. http://www.mpi-sb.mpg.de/AGD/.
P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum numbr of bends. IEEE Transactions on Computers, 49(8), 2000.
U. Brandes, S. Cornelsen, and D. Wagner. How to draw the minimum cuts of a planar graph. In J. Marks, editor, Graph Drawing (Proc. GD’ 00), volume 1984of Lecture Notes Comput. Sci., pages 103–114. Springer-Verlag, 2000.
G. Di Battista, W. Didimo, M. Patrignani, and M. Pizzonia. Orthogonal and quasi-upward drawings with vertices of arbitrary size. In Proc. GD’ 99, volume 1731 of LNCS, pages 297–310, 2000.
G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. TheoryAppl., 7:303–325, 1997.
H. N. Djidjev. A linear algorithm for the maximal planar subgraph problem. In Proc. 4th Workshop Algorithms Data Struct., Lecture Notes Comput. Sci. Springer-Verlag, 1995.
C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Planarity-preserving clustering and embedding for large planar graphs. In J. Kratochvil, editor, Graph Drawing (Proc. GD’ 99), volume 1731 of Lecture Notes Comput. Sci., pages 186–196. Springer-Verlag, 1999.
P. Eades and Q. W. Feng. Multilevel visualization of clustered graphs. In S. North, editor, Graph Drawing (Proc. GD’ 96), volume 1190 of Lecture Notes Comput. Sci., pages 101–112. Springer-Verlag, 1996.
P. Eades, Q. W. Feng, and X. Lin. Straight line drawing algorithms for hierarchical graphs and clustered graphs. In S. North, editor, Graph Drawing (Proc. GD’ 96), volume 1190 of Lecture Notes Comput. Sci., pages 113–128. Springer-Verlag, 1996.
P. Eades, Q. W. Feng, and H. Nagamochi. Drawing clustered graphs on an orthogonal grid. Journal of Graph Algorithms and Applications, 3(4):3–29, 2000.
S. Even. Graph Algorithms. Computer Science Press, Potomac, Maryland, 1979.
Q. W. Feng, R. Cohen, and P. Eades. How to draw a planar clustered graph. In Computing and Combinatorics (Cocoon’ 95), volume 959 of Lecture Notes Comput. Sci., pages 21–30. Springer-Verlag, 1995.
Q. W. Feng, R. F. Cohen, and P. Eades. Planarity for clustered graphs. In P. Spirakis, editor, Symposium on Algorithms (Proc. ESA’ 95), volume 979 of Lecture Notes Comput. Sci., pages 213–226. Springer-Verlag, 1995.
U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD’ 95), volume 1027 of Lecture Notes Comput. Sci., pages 254–266. Springer-Verlag, 1996.
GDToolkit. Graph drawing toolkit. Online. http://www.dia.uniroma3.it/?gdt.
M. L. Huang and P. Eades. A fully animated interactive system for clustering and navigating huge graphs. In S. H. Whitesides, editor, Graph Drawing (Proc. GD’ 98), volume 1547 of Lecture Notes Comput. Sci., pages 374–383. Springer-Verlag, 1998.
M. Jünger, E. K. Lee, P. Mutzel, and T. Odenthal. A polyhedral approach to the multi-layer crossing number problem. In G. Di Battista, editor, Graph Drawing (Proc. GD’ 97), number 1353 in Lecture Notes Comput. Sci., pages 13–24. Springer-Verlag, 1997.
M. Jünger and P. Mutzel. Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica, 16(1):33–59, 1996. (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia).
D. Lütke-Hüttmann. Knickminimales Zeichnen 4-planarer Clustergraphen. Master’s thesis, Universität des Saarlandes, 1999.
T. Nishizeki and N. Chiba. Planar graphs: Theory and algorithms. Ann. Discrete Math., 32, 1988.
B. Schieber and U. Vishkin. On finding lowest common ancestors: Simplification and parallelization. SIAM J. Comput., 17(6):1253–1262, 1988.
K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Trans. Softw. Eng., 21(4):876–892, 1991.
K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man Cybern., SMC-11(2):109–125, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Battista, G., Didimo, W., Marcandalli, A. (2002). Planarization of Clustered Graphs. In: Mutzel, P., Jünger, M., Leipert, S. (eds) Graph Drawing. GD 2001. Lecture Notes in Computer Science, vol 2265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45848-4_5
Download citation
DOI: https://doi.org/10.1007/3-540-45848-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43309-5
Online ISBN: 978-3-540-45848-7
eBook Packages: Springer Book Archive