A layout algorithm for undirected compound graphs

We present an algorithm for the layout of undirected compound graphs, relaxing restrictions of previously known algorithms in regards to topology and geometry. The algorithm is based on the traditional force-directed layout scheme with extensions to handle multi-level nesting, edges between nodes of arbitrary nesting levels, varying node sizes, and other possible application-specific constraints. Experimental results show that the execution time and quality of the produced drawings with respect to commonly accepted layout criteria are quite satisfactory. The algorithm has also been successfully implemented as part of a pathway integration and analysis toolkit named PATIKA, for drawing complicated biological pathways with compartmental constraints and arbitrary nesting relations to represent molecular complexes and various types of pathway abstractions.

[1]  Kozo Sugiyama,et al.  Visualization of structural information: automatic drawing of compound digraphs , 1991, IEEE Trans. Syst. Man Cybern..

[2]  Andreas Ludwig,et al.  A Fast Adaptive Layout Algorithm for Undirected Graphs , 1994, GD.

[3]  Hiroshi Nagamochi,et al.  Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs , 1996, Algorithmica.

[4]  Georg Sander,et al.  Graph Layout through the VCG Tool , 1994, GD.

[5]  Peter Eades,et al.  A Graph Model which Supports Flexible Layout , 1996 .

[6]  Peter Eades,et al.  Multilevel Visualization of Clustered Graphs , 1996, GD.

[7]  Marcus Raitner,et al.  HGV: A Library for Hierarchies, Graphs, and Views , 2002, GD.

[8]  David Harel,et al.  On visual formalisms , 1988, CACM.

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

[10]  Ugur Dogrusöz,et al.  Graph Visualization Toolkits , 2002, IEEE Computer Graphics and Applications.

[11]  Kozo Sugiyama,et al.  A Simple and Unified Method for Drawing Graphs: Magnetic-Spring Algorithm , 1994, GD.

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

[13]  Mirka Miller,et al.  An Algorithm for Drawing Compound Graphs , 1999, GD.

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

[15]  Georg Sander,et al.  Layout of compound directed graphs , 1996 .

[16]  Xiaobo Wang,et al.  Generating Customized Layouts , 1995, Graph Drawing.

[17]  DogrusozUgur,et al.  A layout algorithm for undirected compound graphs , 2009 .

[18]  Emek Demir,et al.  PATIKA: an integrated visual environment for collaborative construction and analysis of cellular pathways , 2002, Bioinform..

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

[20]  Walter Didimo,et al.  Planarization of Clustered Graphs , 2001, Graph Drawing.

[21]  Toshihisa Takagi,et al.  Knowledge representation of signal transduction pathways , 2001, Bioinform..

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

[23]  Richard J. Anderson.  Tree data structures for N-body simulation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[24]  Ayellet Tal,et al.  Dynamic Drawing of Clustered Graphs , 2004, IEEE Symposium on Information Visualization.

[25]  Peter Eades,et al.  Journal of Graph Algorithms and Applications Navigating Clustered Graphs Using Force-directed Methods , 2022 .

[26]  Emilio Di Giacomo,et al.  Graph Visualization Techniques for Web Clustering Engines , 2007, IEEE Transactions on Visualization and Computer Graphics.

[27]  Emek Demir,et al.  Patikaweb: a Web interface for analyzing biological pathways through advanced querying and visualization , 2006, Bioinform..

[28]  Kozo Sugiyama,et al.  A Generic Compound Graph Visualizer/Manipulator: D-ABDUCTOR , 1995, Graph Drawing.