Circular Layout in the Graph Layout Toolkit

Dogrusoz, Ugur and Madden, Brendan and Madden, Patrick (1997) Circular Layout in the Graph Layout Toolkit. In: Symposium on Graph Drawing, GD '96, September 18-20, 1996, Berkeley, California, USA , pp. 92-100 (Official URL: http://dx.doi.org/10.1007/3-540-62495-3_40).

Full text not available from this repository.

Abstract

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 adresses, 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.

Item Type:Conference Paper
Additional Information:10.1007/3-540-62495-3_40
Classifications:S Software and Systems > S.001 General
P Styles > P.180 Cluster
G Algorithms and Complexity > G.420 Crossings
G Algorithms and Complexity > G.350 Clusters
P Styles > P.120 Circular
ID Code:105

Repository Staff Only: item control page

References

G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Comput. Geom. Theory Appl., 4, (1994), 235-282.

Tom Sawyer Software: Graph Layout Toolkit User's Guide, Berkeley, CA, (1992 - 1996).

Tom Sawyer Software: Graph Layout Toolkit Reference Manual, Berkeley, CA, (1992 - 1996).

Kar, G., Madden, B.P., Gilbert, R.S.: Heuristic Layout Algorithmsfor Network Management Presentation Services. IEEE Network November (1988) 29-36.

Tollis, I.G., Xia, C.: Drawing Telecommunications Networks. Proc. Graph Drawing '94, LNCS 894, Springer Verlag, (1994), 206-217.

Kernighan, B.W., Lin, S.: An Efficient Heuristic for Partitioning Graphs. Bell Systems Technical Journal, 49, (1970), 291-307.

Madden, B., Madden, P., Powers, S., Himsolt, M.: Portable Graph Layout and Editing. Proc. Graph Drawing '95, LNCS 1027, Springer Verlag, (1995), 385-395.

K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man. Cybern., 11, (1981) 109-125.