Incremental diagram layout for automated model migration

A range of successful modeling tools to develop complex systems use node-link-style diagrams as their underlying language. Over the years such languages can change, for instance as part of a tool update. When migrating existing models, changes in syntax directly affect the placement of elements in their diagrams. Increasing the size of certain nodes may for example result in node overlaps. In this paper we propose two methods based on graph drawing techniques to adjust the layout of existing diagrams after migration. Although we designed these techniques for diagram migration, they are applicable to other scenarios as well, such as users interactively adding or resizing nodes. We evaluate the techniques based on real world diagrams from the LabVIEW suite and discuss the scenarios each technique seems best suited for.

[1]  Roberto Tamassia,et al.  Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms , 2000, J. Graph Algorithms Appl..

[2]  Reinhard von Hanxleden,et al.  Drawing layered graphs with port constraints , 2014, J. Vis. Lang. Comput..

[3]  Ulrik Brandes,et al.  Sketch-Driven Orthogonal Graph Drawing , 2002, GD.

[4]  Michael Forster,et al.  Applying Crossing Reduction Strategies to Layered Compound Graphs , 2002, GD.

[5]  D. Hightower,et al.  A solution to line routing problems on the continuous plane , 1988 .

[6]  Yifan Hu,et al.  Efficient Node Overlap Removal Using a Proximity Stress Model , 2009, GD.

[7]  Richard F. Paige,et al.  Evolving models in Model-Driven Engineering: State-of-the-art and future challenges , 2016, J. Syst. Softw..

[8]  Stephen C. North,et al.  Online Hierarchical Graph Drawing , 2001, GD.

[9]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[10]  Mitsuhiko Toda,et al.  Methods for Visual Understanding of Hierarchical System Structures , 1981, IEEE Transactions on Systems, Man, and Cybernetics.

[11]  Roberto Tamassia,et al.  A User Study in Similarity Measures for Graph Drawing , 2000, J. Graph Algorithms Appl..

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

[13]  Kim Marriott,et al.  Topology Preserving Constrained Graph Layout , 2009, GD.

[14]  Peter J. Stuckey,et al.  Orthogonal Connector Routing , 2009, GD.

[15]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[16]  Miro Spönemann,et al.  Graph Layout Support for Model-Driven Engineering , 2015 .

[17]  Peter J. Stuckey,et al.  Fast Node Overlap Removal , 2005, GD.

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

[19]  Peter Eades,et al.  Using Spring Algorithms to Remove Node Overlapping , 2005, APVIS.

[20]  Roberto Tamassia,et al.  InteractiveGiotto: An Algorithm for Interactive Orthogonal Graph Drawing , 1997, GD.

[21]  Bernhard Schätz,et al.  Graph and model transformation tools for model migration , 2014, Software & Systems Modeling.

[22]  Reinhard von Hanxleden,et al.  Using One-Dimensional Compaction for Smaller Graph Drawings , 2016, Diagrams.

[23]  Junbin Gao,et al.  A new algorithm for removing node overlapping in graph visualization , 2007, Inf. Sci..

[24]  Reinhard von Hanxleden,et al.  On Comments in Visual Languages , 2016, Diagrams.

[25]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

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

[27]  Emden R. Gansner,et al.  A Technique for Drawing Directed Graphs , 1993, IEEE Trans. Software Eng..