research-article

Open access

Incremental diagram layout for automated model migration

Authors:

Rajneesh Lakkundi,

Anand Kodaganur,

Christoph Daniel Schulze,

Reinhard von HanxledenAuthors Info & Claims

MODELS '16: Proceedings of the ACM/IEEE 19th International Conference on Model Driven Engineering Languages and Systems

Pages 185 - 195

https://doi.org/10.1145/2976767.2976805

Published: 02 October 2016 Publication History

Abstract

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.

References

[1]

U. Brandes, M. Eiglsperger, M. Kaufmann, and D. Wagner. Sketch-driven orthogonal graph drawing. In Proceedings of the 10th International Symposium on Graph Drawing (GD'02), volume 2528 of LNCS, pages 1--11. Springer, 2002.

Digital Library

[2]

S. Bridgeman and R. Tamassia. Difference metrics for interactive orthogonal graph drawing algorithms. In Graph Drawing, pages 57--71. Springer, 1998.

Digital Library

[3]

S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara. InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. In Graph Drawing (Proc. GD'97), volume 1353, pages 303--308. Springer, 1997.

Digital Library

[4]

S. S. Bridgeman and R. Tamassia. A user study in similarity measures for graph drawing. Journal of Graph Algorithms and Applications, 6(3):225--254, 2002.

[5]

G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1999.

Digital Library

[6]

T. Dwyer, K. Marriott, and P. J. Stuckey. Fast node overlap removal. In P. Healy and N. S. Nikolov, editors, Proceedings of the 13th International Symposium on Graph Drawing (GD'05), volume 3843 of LNCS, pages 153--164. Springer, 2006.

Digital Library

[7]

T. Dwyer, K. Marriott, and M. Wybrow. Topology preserving constrained graph layout. In Revised Papers of the 16th International Symposium on Graph Drawing (GD'08), volume 5417 of LNCS, pages 230--241. Springer, 2009.

Digital Library

[8]

M. Forster. Applying crossing reduction strategies to layered compound graphs. In Proceedings of the 10th International Symposium on Graph Drawing (GD'02), volume 2528 of LNCS, pages 115--132. Springer, 2002.

Digital Library

[9]

K. Freivalds and P. Kikusts. Optimum layout adjustment supporting ordering constraints in graph-like diagram drawing. volume 55 of Proceedings of the Latvian Academy of Sciences, pages 43--51. 2001.

[10]

E. R. Gansner and Y. Hu. Efficient node overlap removal using a proximity stress model. In I. G. Tollis and M. Patrignani, editors, Graph Drawing, pages 206--217, Berlin, Heidelberg, 2009. Springer-Verlag.

Digital Library

[11]

E. R. Gansner, E. Koutsofios, S. C. North, and K.-P. Vo. A technique for drawing directed graphs. Software Engineering, 19(3):214--230, 1993.

Digital Library

[12]

M. R. Garey and D. S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, New York, 1979.

Digital Library

[13]

M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods, 4(3):312--316, 1983.

[14]

K. Hayashi, M. Inoue, T. Masuzawa, and H. Fujiwara. A layout adjustment problem for disjoint rectangles preserving orthogonal order. In Graph Drawing, pages 183--197. Springer, 1998.

Digital Library

[15]

D. W. Hightower. A solution to line-routing problems on the continuous plane. In Proceedings of the 6th Annual Design Automation Conference, DAC '69, pages 1--24, New York, NY, USA, 1969. ACM.

Digital Library

[16]

X. Huang, W. Lai, A. Sajeev, and J. Gao. A new algorithm for removing node overlapping in graph visualization. Information Sciences, 177(14):2821--2844, 2007.

Digital Library

[17]

W. Li, P. Eades, and N. Nikolov. Using spring algorithms to remove node overlapping. In Proceedings of the 2005 Asia-Pacific symposium on Information visualisation-Volume 45, pages 131--140. Australian Computer Society, Inc., 2005.

Digital Library

[18]

K. Marriott, P. Stuckey, V. Tam, and W. He. Removing node overlapping in graph layout using constrained optimization. Constraints, 8(2):143--171, Apr. 2003.

Digital Library

[19]

K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. Journal of Visual Languages & Computing, 6(2):183--210, June 1995.

[20]

S. C. North and G. Woodhull. Online hierarchical graph drawing. In Revised Papers of the 9th International Symposium on Graph Drawing, volume 2265 of LNCS, pages 232--246. Springer, 2002.

Digital Library

[21]

R. F. Paige, N. Matragkas, and L. M. Rose. Evolving models in Model-Driven Engineering: State-of-the-art and future challenges. Journal of Systems and Software, 111:272 -- 280, 2016.

Digital Library

[22]

L. M. Rose, M. Herrmannsdoerfer, S. Mazanek, P. Van Gorp, S. Buchwald, T. Horn, E. Kalnina, A. Koch, K. Lano, B. Schätz, and M. Wimmer. Graph and model transformation tools for model migration. Software & Systems Modeling, 13(1):323--359, 2012.

Digital Library

[23]

U. Rüegg, C. D. Schulze, D. Grevismühl, and R. von Hanxleden. Using one-dimensional compaction for smaller graph drawings. In Proceedings of the 9th International Conference on the Theory and Application of Diagrams (DIAGRAMS'16), 2016.

[24]

C. D. Schulze, C. Plöger, and R. von Hanxleden. On comments in visual languages. In Proceedings of the 9th International Conference on the Theory and Application of Diagrams (DIAGRAMS'16), 2016.

[25]

C. D. Schulze, M. Spönemann, and R. von Hanxleden. Drawing layered graphs with port constraints. Journal of Visual Languages and Computing, Special Issue on Diagram Aesthetics and Layout, 25(2):89--106, 2014.

Digital Library

[26]

M. Spönemann. Graph layout support for model-driven engineering. Number 2015/2 in Kiel Computer Science Series. Department of Computer Science, 2015. Dissertation, Faculty of Engineering, Christian-Albrechts-Universität zu Kiel.

[27]

K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics, 11(2):109--125, Feb. 1981.

[28]

M. Wybrow, K. Marriott, and P. J. Stuckey. Orthogonal connector routing. In Proceedings of the 17th International Symposium on Graph Drawing (GD'09), volume 5849 of LNCS, pages 219--231. Springer, 2010.

Digital Library

Cited By

von Hanxleden RLee EFuhrmann HSchulz-Rosengarten ADomrös SLohstroh MBateni SMenard C(2022)Pragmatics Twelve Years Later: A Report on Lingua FrancaLeveraging Applications of Formal Methods, Verification and Validation. Software Engineering10.1007/978-3-031-19756-7_5(60-89)Online publication date: 22-Oct-2022
https://dl.acm.org/doi/10.1007/978-3-031-19756-7_5
Ali HMussbacher GGherbi AHamou-Lhadj WBali A(2020)Layout Merging with Relative PositioningProceedings of the 12th System Analysis and Modelling Conference10.1145/3419804.3420271(106-115)Online publication date: 19-Oct-2020
https://dl.acm.org/doi/10.1145/3419804.3420271
Binucci CBrandes UDwyer TGronemann Mvon Hanxleden Rvan Kreveld MMutzel PSchaefer MSchreiber FSpeckmann B(2019)10 Reasons to Get Interested in Graph DrawingComputing and Software Science10.1007/978-3-319-91908-9_6(85-104)Online publication date: 2019
https://doi.org/10.1007/978-3-319-91908-9_6

Recommendations

Automated transformation of design text ROM diagram into SysML models

This paper proposes an approach to generating System Modeling Language (SysML) diagrams from a Recursive Object Model (ROM) diagram. The ROM diagram represents entities (or concepts) and three kinds of relations between these entities found in a ...
Diagram Size vs. Layout Flaws: Understanding Quality Factors of UML Diagrams
ESEM '16: Proceedings of the 10th ACM/IEEE International Symposium on Empirical Software Engineering and Measurement

Context: Previously, we have defined the notion of diagram size and studied its impact on the understanding of UML diagrams. Subsequently, questions have been raised regarding the reliability and generality of our findings. Also, new questions arose ...
Diagram definition: a case study with the UML class diagram
MODELS'11: Proceedings of the 14th international conference on Model driven engineering languages and systems

The abstract syntax of a graphical modeling language is typically defined with a metamodel while its concrete syntax (diagram) is informally defined with text and figures. Recently, the Object Management Group (OMG) released a beta specification, called ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

MODELS '16: Proceedings of the ACM/IEEE 19th International Conference on Model Driven Engineering Languages and Systems

October 2016

414 pages

ISBN:9781450343213

DOI:10.1145/2976767

General Chairs:
Benoit Baudry
Inria, France
,
Benoit Combemale
Inria, France
,
Program Chairs:
Jörg Kienzle
McGill University, Montreal, Canada
,
Alexander Pretschner
Technical University Munich, Germany

Copyright © 2016 Owner/Author.

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

SIGSOFT: ACM Special Interest Group on Software Engineering
IEEE-CS: Computer Society

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 02 October 2016

Check for updates

Qualifiers

Research-article

Conference

MODELS '16

Sponsor:

SIGSOFT
IEEE-CS

MODELS '16: ACM/IEEE 19th International Conference on Model Driven Engineering Languages and Systems

October 2 - 7, 2016

Saint-malo, France

Acceptance Rates

Overall Acceptance Rate 144 of 506 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
369
Total Downloads

Downloads (Last 12 months)48
Downloads (Last 6 weeks)2

Reflects downloads up to 25 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

von Hanxleden RLee EFuhrmann HSchulz-Rosengarten ADomrös SLohstroh MBateni SMenard C(2022)Pragmatics Twelve Years Later: A Report on Lingua FrancaLeveraging Applications of Formal Methods, Verification and Validation. Software Engineering10.1007/978-3-031-19756-7_5(60-89)Online publication date: 22-Oct-2022
https://dl.acm.org/doi/10.1007/978-3-031-19756-7_5
Ali HMussbacher GGherbi AHamou-Lhadj WBali A(2020)Layout Merging with Relative PositioningProceedings of the 12th System Analysis and Modelling Conference10.1145/3419804.3420271(106-115)Online publication date: 19-Oct-2020
https://dl.acm.org/doi/10.1145/3419804.3420271
Binucci CBrandes UDwyer TGronemann Mvon Hanxleden Rvan Kreveld MMutzel PSchaefer MSchreiber FSpeckmann B(2019)10 Reasons to Get Interested in Graph DrawingComputing and Software Science10.1007/978-3-319-91908-9_6(85-104)Online publication date: 2019
https://doi.org/10.1007/978-3-319-91908-9_6

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents