Clan-Based Incremental Drawing

  • Fwu-Shan Shieh
  • Carolyn L. McCreary
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1984)


The stability is an essential issue for incremental drawings. To allow stable updating, means to modify graph slightly (such as adding or deleting an edge or a node) without changing the layout dramatically from previous layout. In this paper, a method for achieving stable incremental directed graph layout by using clan-based graph decomposition is described. For a given directed graph, the clan-based decomposition generates a parse tree. The parse tree, which is used for layout, is also employed in locating changes and maintaining visual stability during incremental drawing. By using the generated parse tree, each incremental update can be done very efficiently.


Parse Tree Extra Space Graph Drawing Layout Algorithm Current Graph 
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.


  1. 1.
    J. H. Cross II and R. S. Dannelly, “Reverse Engineering Graphical Representations of X Source Code,” International Journal of Software Engineering and Knowledge Engineering, Spring, 1996.Google Scholar
  2. 2.
    A. H. Deutz, A. Ehrenfeucht, G. Rozenberg, “Clans and regions in 2-structures,” Theoretical Computer Science, 129, 207–262, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    G. Di Battista, P. Eades, R. Tamassia, I. Tollis, “Algorithms for Drawing Graphs: an Annotated Bibliography”, Computation Geometry: Theory and Applications, 4(5):235–282, 1994.zbMATHGoogle Scholar
  4. 4.
    A. Ehrenfeucht and G. Rozenberg, “Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms,” Theoretical Computer Science, Vol. 70, 277–303, 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    A. Ehrenfeucht and G. Rozenberg, “Theory of 2-Structures, Part II: Representation Through Labeled Tree Families,” Theoretical Computer Science, Vol. 70, 305–342, 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    M. Frohlich,“Incremental Graphout in Visualization System-daVinci,” PhD thesis, Department of Computer Science, The University of Bremen, Germany, November 1997.Google Scholar
  7. 7.
    C. M. McCreary, R. O. Chapman, and F. S. Shieh, “Using Graph Paring for Automatic Graph Drawing”, IEEE Trans. on Systems Man, and Cybernetics — Part A: Systems and Humans, Vol. 28, No. 5, 545–561, 1998.CrossRefGoogle Scholar
  8. 8.
    C. L. McCreary and A. Reed, “A Graph Parsing Algorithm and Implementation,” Tech. Rpt. TR-93-04, Dept. of Comp. Sci and Eng., Auburn U. 1993.Google Scholar
  9. 9.
    C. McCreary, F. S. Shieh, and H. Gill, “CG: a Graph Drawing System Using Graph Grammar Parsing,” Lecture Notes in Computer Science, Vol. 894, 270–273, Springer-Verlag, 1995.Google Scholar
  10. 10.
    S. C. North, “Incremental Layout in DynaDAG,” Lecture Notes in Computer Science, Vol. 1027, 409–418, Springer-Verlag, 1996.Google Scholar
  11. 11.
    G. Sander, “Graph Drawing Tools and Related Work,”
  12. 12.
    F. S. Shieh, “Stability and Topology of Graph Drawing,” Auburn University, Ph.D. dissertation, 2000.Google Scholar
  13. 13.
    F. S. Shieh, and C. L. McCreary, “Directed Graphs Drawing by Clan-based Decomposition,” Lecture Notes in Computer Science, Vol. 1027, 472–482, Springer-Verlag, 1996.Google Scholar
  14. 14.
    Tom Sawyer, “Graph Toolkit”.
  15. 15.
    K. Sugiyama, S. Tagawa and M. Toda, “Methods for Understanding of Hierarchical System Structures,” IEEE Trans. on Sys. Man, and Cyb., SMC-11, 109–125, 1981.CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Fwu-Shan Shieh
    • 1
  • Carolyn L. McCreary
    • 2
  1. 1.Minolta-QMS, Inc.MobileUSA
  2. 2.Compaq Computer CorporationShrewsburyUSA

Personalised recommendations