Multilevel visualization of clustered graphs

  • Peter Eades
  • Qing-Wen Feng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1190)

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 algorithms for 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.

References

  1. 1.
    G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61:175–198, 1988.CrossRefGoogle Scholar
  2. 2.
    G. Di Battista, R. Tamassia, and I.G. Tollis. Constrained visibility representations of graphs. Information Processing Letters, 41:1–7, 1992.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:339–344, 1976.CrossRefGoogle Scholar
  6. 6.
    Qing-Wen Feng, Robert F. Cohen, and Peter Eades. How to draw a planar clustered graph. In COCOON'95, volume 959 of Lecture Notes in Computer Science, pages 21–31. Springer-Verlag, 1995.Google Scholar
  7. 7.
    D. Harel. On visual formalisms. Communications of the ACM, 31(5):514–530, 1988.CrossRefGoogle Scholar
  8. 8.
    J. Kawakita. The KJ method — a scientific approach to problem solving. Technical report, Kawakita Research Institute, Tokyo, 1975.Google Scholar
  9. 9.
    Brendan Madden, Patrick Madden, Steve Powers, and Michael Himsolt. Portable graph layout and editing. In GD'95, volume 1027 of Lecture Notes in Computer Science, pages 385–395. Springer-Verlag.Google Scholar
  10. 10.
    K. Misue and K. Sugiyama. An overview of diagram based idea organizer: Dabductor. Technical Report IIAS-RR-93-3E, ISIS, Fujitsu Laboratories, 1993.Google Scholar
  11. 11.
    Stephen C. North. Drawing ranked digraphs with recursive clusters. In Proc. ALCOM Workshop on Graph Drawing '93, September 1993.Google Scholar
  12. 12.
    Tom Sawyer Software. Graph layout toolkit. available from bmadden@TomSawyer.COM.Google Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    W. T. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, 3(13):743–768, 1963.Google Scholar
  16. 16.
    C. Williams, J. Rasure, and C. Hansen. The state of the art of visual languages for visualization. In Visualization 92, pages 202–209, 1992.Google Scholar

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Peter Eades
    • 1
  • Qing-Wen Feng
    • 1
  1. 1.Department of Computer Science and Software EngineeringUniversity of NewcastleAustralia

Personalised recommendations