Multilevel Visualization of Clustered Graphs

Eades, Peter and Feng, Qing-Wen (1997) Multilevel Visualization of Clustered Graphs. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 101-112 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_41).

Full text not available from this repository.

Abstract

Clustered graphs are graphs with recursive clustering structures over the vertices. This type of structure appears in many systems. Examples include CASE tools, management information systems, VLSI design tools, and reverse engineering systems. Existing layout algorithms represent the clustering structure as recursively nested regions in the plane. However, as the structure becomes more and more complex, two dimensional plane representations tend to be insufficient. In this paper, firstly, we describe some two dimensional plane drawing algorithmsfor clustered graphs; then we show how to extend two dimensional plane drawings to three dimensional multilevel drawings. We consider two conventions: straight-line convex drawings and orthogonal rectangular drawings; and we show some examples.

Item Type:Conference Paper
Additional Information:10.1007/3-540-62495-3_41
Classifications:P Styles > P.720 Straight-line
P Styles > P.180 Cluster
P Styles > P.600 Poly-line > P.600.700 Orthogonal
P Styles > P.060 3D
G Algorithms and Complexity > G.350 Clusters
ID Code:106

Repository Staff Only: item control page

References

G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61:175-198, 1988.

G. Di Battista, R. Tamassia, and I.G. Tollis. Constrained visibility representations of graphs. Inform. Process. Lett., 41:1-7, 1992.

Peter Eades and Qing-Wen Feng. Orthogonal grid drawing of clustered graphs. Technical Report 96-04, Department of Computer Science, The University of Newcastle, Australia, 1996.

Peter Eades, Qing-Wen Feng, and Xuemin Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. Technical Report 96-02, Department of Computer Science, The University of Newcastle, Australia, 1996.

S. Even and R.E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:339-344, 1976.

Qing-Wen Feng, Robert F. Cohen, and Peter Eades. How to draw a planar clustered graph. In COCOON '95, volume 959 of LNCS, pages 21-31. Springer-Verlag, 1995.

D. Harel. On visual formalisms. Communications of the ACM, 31(5):514-530, 1988.

J. Kawakita. The KJ method - a scientific approach to problem solving. Technical Report, Kawakita Research Institute, Tokyo, 1975.

Brendan Madden, Patrick Madden, Steve Powers, and Michael Himsolt. Portable graph layout and editing. In F.J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of LNCS, pages 385-395. Springer-Verlag, 1996.

K. Misue and K. Sugiyama. An overview of diagram based idea organizer: D-abductor. Technical Report IIAS-RR-93-3E, ISIS, Fujitsu Laboratories, 1993.

Stephen C. North. Drawing ranked digraphs with recursive clusters. In Proc. ALCOM Workshop on Graph Drawing '93, September 1993.

Tom Sawyer Software. Graph Layout Toolkit. available from bmadden@TomSawyer.COM.

K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics, 21(4):876-892, 1991.

R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, SMC-18(1):61-79, 1988.

W.T. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, 3(13):743-768, 1963.

C. Williams, J. Rasure, and C. Hansen. The state of the art of visual languages for visualization. In Visualization 92, pages 202-209, 1992.