An Algorithm for Drawing Compound Graphs

  • François Bertault
  • Mirka Miller
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1731)

Abstract

We present a new algorithm, called Nuage, for drawing graphs with both adjacency and inclusion relationships between nodes, that is, compound graphs. Compound graphs are more general than classical graph models or clustered graphs. Nuage can be applied to both directed and undirected compound graphs. It can be parameterized by classical graph drawing algorithms. Nuage can be viewed as a method for unifying several classical algorithms within the same drawing by using the structure of the compound graph. Additionally, we present a refinement technique that can be used in conjunction with Nuage to reduce the number of edge crossings.

References

  1. 1.
    G. Di Battista, P. D. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography,. Computational Geometry: theory and applications, 4(5):235–282, 1994.MATHMathSciNetGoogle Scholar
  2. 2.
    P. D. Eades and Q.-W. Feng. Multilevel visualisation of clustered graphs. In S. North, editor, Graph drawing, volume 1190, pages 101–111, Berkeley (USA), 1996. Springer Verlag.Google Scholar
  3. 3.
    P. D. Eades, Q.-W. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In S. North, editor, Graph drawing, volume 1190, pages 113–127, Berkeley (USA), 1996. Springer Verlag.Google Scholar
  4. 4.
    T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21(11):1129–1164, 1991.CrossRefGoogle Scholar
  5. 5.
    D. Harel. On visual formalisms. Communications of the ACM, 31(5):514–530, 1988.CrossRefMathSciNetGoogle Scholar
  6. 6.
    S. C. North. Drawing ranked digraphs with recursive clusters. ALCOM Workshop on Graph Drawing 93, 1993.Google Scholar
  7. 7.
    E. M. Reingold and J. S. Tilford. Tidier drawings of trees. IEEE Transactions on Software Engineering, SE-7(2):223–228, March 1981.CrossRefGoogle Scholar
  8. 8.
    K. Sugiyama and K. Misue. Visualisation of structural information: automatic drawing of compound digraphs. IEEE Trans. SMC, 4(21):876–893, 1991.MathSciNetGoogle Scholar
  9. 9.
    K. Sugiyama and K. Misue. A generic compound graph visualizer/manipulator: D-Abductor. In F. J. Brandenburg, editor, Graph Drawing, volume 1027 of Lecture Notes in Computer Science, pages 500–503, Passau (Allemagne), 1995. Springer Verlag.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • François Bertault
    • 1
  • Mirka Miller
    • 1
  1. 1.Department of Computer Science and Software EngineeringUniversity of NewcastleCallaghanAustralia

Personalised recommendations