Algorithms for Cluster Busting in Anchored Graph Drawing

Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maintain a user’s mental picture of the original layout. We present a new approach to layout adjustment called cluster busting in anchored graph drawing. We then give two algorithms as examples of this approach. The goals of cluster busting in anchored graph drawing are to more evenly distribute the nodes of the graph in a drawing window while maintaining the user’s mental picture of the original drawing. We present simple and ecient iterative heuristics to accomplish these goals. We formally dene some measures of distribution and similarity and give empirical results based on these measures to quantify our methods. The theoretical analysis of our heuristics presents a formidable challenge, thus justifying our empirical analysis.

[1]  Godfried T. Toussaint,et al.  Computational geometry: Recent results relevant to pattern recognition , 1987 .

[2]  N. Quinn,et al.  A forced directed component placement procedure for printed circuit boards , 1979 .

[3]  Clifford J. Fisk,et al.  “ACCEL” automated circuit card etching layout , 1965, DAC.

[4]  Kelly A. Lyons.  Cluster busting in anchored graph drawing , 1992, CASCON.

[5]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

[6]  James Won-Ki Hong,et al.  A Distributed System Architecture for a Distributed Application Environment , 1994, IBM Syst. J..

[7]  Ioannis G. Tollis,et al.  A framework for dynamic graph drawing , 1992, SCG '92.

[8]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[9]  Richard Pollack,et al.  Multidimensional Sorting , 1983, SIAM J. Comput..

[10]  Godfried T. Toussaint,et al.  PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[11]  Frances Paulisch,et al.  Using constraints to achieve stability in automatic graph layout algorithms , 1990, CHI '90.

[12]  Raimund Seidel,et al.  Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[13]  Godfried T. Toussaint,et al.  Computational Geometric Problems in Pattern Recognition , 1982 .

[14]  Kelly A. Lyons,et al.  Narratives of space and time: visualization for distributed applications , 1991, CASCON.

[15]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[16]  Roberto Tamassia,et al.  An incremental approach to aesthetic graph layout , 1993, Proceedings of 6th International Workshop on Computer-Aided Software Engineering.

[17]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[18]  Robert A. M. Gregson,et al.  Psychometrics of similarity , 1975 .

[19]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[20]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[21]  Michael H. Kalantar,et al.  Operation jump start: a CORDS integration prototype using DCE , 1993, CASCON.

[22]  Georges Voronoi.  Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs. , 1908 .

[23]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[24]  Sven Moen,et al.  Drawing dynamic trees , 1990, IEEE Software.

[25]  Lawrence A. Rowe,et al.  A divide-and-conquer algorithm for the automatic layout of large directed graphs , 1991, IEEE Trans. Syst. Man Cybern..

[26]  David Harel,et al.  Drawing graphs nicely using simulated annealing , 1996, TOGS.

[27]  Kozo Sugiyama,et al.  Layout Adjustment and the Mental Map , 1995, J. Vis. Lang. Comput..

[28]  Mandyam M. Srinivasan,et al.  NetMod: A Design Tool for Large-Scale Heterogeneous Campus Networks , 1991, IEEE J. Sel. Areas Commun..