A Scalable Algorithm for Adjusting Node-Node Overlaps

The node-node overlaps, which occur in drawing of labeled graphs, and more importantly, in the dynamic drawing, have been a problem in graph visualization. Several approaches have recently been proposed to solve such a problem. These approaches, however, lack the scalabilities of dealing with large number of overlapping nodes. Providing a formal description of the problem, this paper presents a scalable version of our previous approach called the force-transfer algorithm. Compared to other methods, our new algorithm is able to achieve the compact adjusted layout of a large graph

[1]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

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

[3]  Xiaodi Huang,et al.  Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout , 2003, ACSC.

[4]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[5]  R. Forthofer,et al.  Rank Correlation Methods , 1981 .

[6]  Peter J. Stuckey,et al.  Removing Node Overlapping in Graph Layout Using Constrained Optimization , 2003, Constraints.

[7]  Toshimitsu Masuzawa,et al.  A layout adjustment problem for disjoint rectangles preserving orthogonal order , 2002, Systems and Computers in Japan.

[8]  Toshimitsu Masuzawa,et al.  A layout adjustment problem for disjoint rectangles preserving orthogonal order , 1998, Systems and Computers in Japan.

[9]  Kim Marriott,et al.  Constrained Graph Layout , 1996, Constraints.

[10]  David Harel,et al.  Drawing graphs with non-uniform vertices , 2002, AVI '02.

[11]  Hausi A. Müller,et al.  Graph Layout Adjustment Strategies , 1995, GD.

[12]  Xiaodi Huang.  Filtering, clustering and dynamic layout for graph visualization , 2004 .

[13]  Peter Eades,et al.  Removing edge-node intersections in drawings of graphs , 2002, Inf. Process. Lett..

[14]  Kim Marriott,et al.  Removing node overlapping using constrained optimization , 1997 .

[15]  J. M. Bevan,et al.  Rank Correlation Methods , 1949 .

[16]  Kelly A. Lyons,et al.  Algorithms for Cluster Busting in Anchored Graph Drawing , 1998, J. Graph Algorithms Appl..

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

[18]  Dan Boneh,et al.  On genetic algorithms , 1995, COLT '95.

[19]  Moni Naor,et al.  Rank aggregation methods for the Web , 2001, WWW '01.

[20]  Shigeo Morishima,et al.  Styling and animating human hair , 2002, Systems and Computers in Japan.