Circular layout in the Graph Layout toolkit

  • Uğur Doğrusöz
  • Brendan Madden
  • Patrick Madden
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1190)


The Graph Layout Toolkit is a family of portable, automated, graph layout libraries designed for integration into graphical user interface application programs. The Circular Library is one of the four styles currently available with the Graph Layout Toolkit. It produces layouts that emphasize natural group structures inherent in a graph's topology, and is well suited for the layout of ring and star network topologies. It clusters (groups) the nodes of a graph by group IDs, by IP addresses, and by biconnectivity or node degree, and allows the user to specify a range for the size of each cluster. The Library positions the nodes of a cluster on a radiating circle, and employs heuristics to reduce the crossings not only between edges incident to nodes of the same cluster but also between edges that connect different clusters.


Node Degree Cluster Graph Layout Algorithm Graph Layout Virtual Cluster 
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. [DETT95]
    Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for drawing graphs: An annotated bibliography. In Computational Geometry: Theory and Applications, 4, (1994), 235–282.MathSciNetGoogle Scholar
  2. [GLT96a]
    Tom Sawyer Software: Graph Layout Toolkit User's Guide, Berkeley, CA, (1992–1996).Google Scholar
  3. [GLT96b]
    Tom Sawyer Software: Graph Layout Toolkit Reference Manual, Berkeley, CA, (1992–1996).Google Scholar
  4. [KMG89]
    Kar, G., Madden, B.P., Gilbert, R.S.: Heuristic Layout Algorithms for Network Management Presentation Services. IEEE Network November (1988) 29–36.Google Scholar
  5. [KL70]
    Tollis, I.G., Xia, C.: Drawing Telecommunications Networks. Proc. Graph Drawing '94, Lecture Notes in Computer Science 894, Springer Verlag, (1994), 206–217.Google Scholar
  6. [KL70]
    Kernighan, B.W., Lin, S.: An Efficient Heuristic for Partitioning Graphs. Bell Systems Technical Journal, 49, (1970), 291–307.Google Scholar
  7. [MMPH95]
    Madden, B., Madden, P., Powers, S., Himsolt, M.: Portable Graph Layout and Editing. Proc. Graph Drawing '95, Lecture Notes in Computer Science 1027, Springer Verlag, (1995), 385–395.Google Scholar
  8. [STT81]
    Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical systems. IEEE Transactions on Systems, Man and Cybernetics, 11, (1981) 109–125.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Uğur Doğrusöz
    • 1
  • Brendan Madden
    • 1
  • Patrick Madden
    • 1
  1. 1.Tom Sawyer SoftwareBerkeley

Personalised recommendations