Port Constraints in Hierarchical Layout of Data Flow Diagrams

We present a new application for graph drawing in the context of graphical model-based system design, where manual placing of graphical items is still state-of-the-practice. The KIELER framework aims at improving this by offering novel user interaction techniques, enabled by automatic layout of the diagrams. In this paper we present extensions of the well-known hierarchical layout approach, originally suggested by Sugiyama et al. [22], to support port constraints, hyperedges, and compound graphs in order to layout diagrams of data flow languages. A case study and experimental results show that our algorithm is well suited for application in interactive user interfaces.

[1]  Robert M. Keller,et al.  Data Flow Program Graphs , 1982, Computer.

[2]  Bernd Becker,et al.  Orthogonal Hypergraph Drawing for Improved Visibility , 2006, J. Graph Algorithms Appl..

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

[4]  Anthony Cahill,et al.  Experiences in automatic levelling of data flow diagrams , 1996, WPC '96. 4th Workshop on Program Comprehension.

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

[6]  Georg Sander,et al.  The ILOG JViews Graph Layout Module , 2001, Graph Drawing.

[7]  Edward A. Lee,et al.  Taming heterogeneity - the Ptolemy approach , 2003, Proc. IEEE.

[8]  Ned Chapin,et al.  Some structured analysis techniques , 1978, DATB.

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

[10]  Georg Sander,et al.  Layout of Directed Hypergraphs with Orthogonal Hyperedges , 2003, GD.

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

[12]  Michael Kaufmann,et al.  yFiles - Visualization and Automatic Layout of Graphs , 2001, Graph Drawing Software.

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

[14]  Georg Sander,et al.  A Fast Heuristic for Hierarchical Manhattan Layout , 1995, GD.

[15]  Danil E. Baburin.  Using graph based representations in reengineering , 2002, Proceedings of the Sixth European Conference on Software Maintenance and Reengineering.

[16]  Carlo Batini,et al.  A layout algorithm for data flow diagrams , 1986, IEEE Transactions on Software Engineering.

[17]  C. Lageweg.  Designing an Automatic Schematic Generator for a Netlist Description , 1998 .

[18]  Amit Misra,et al.  Automatic Generation of Digital System Schematic Diagrams , 1986, IEEE Design & Test of Computers.

[19]  Reinhard von Hanxleden,et al.  Statechart development beyond WYSIWYG , 2007, MODELS'07.

[20]  Thomas Eschbach.  Visualisierungen im Schaltkreisentwurf , 2008 .

[21]  Miro Spönemann,et al.  Kiel Automatic Layout of Data Flow Diagrams in KIELER and Ptolemy II , 2009 .

[22]  Amit Misra,et al.  Automatic Generation of Digital System Schematic Diagrams , 1985, DAC 1985.

[23]  Kevin Lano,et al.  Slicing of UML models using model transformations , 2010, MODELS'10.