Improved Layout for Data Flow Diagrams with Port Constraints

The automatic generation of graphical views for data flow models and the efficient development of such models require layout algorithms that are able to handle their specific requirements. Examples include constraints on the placement of ports as well as the proper handling of nested models. We present an algorithm for laying out data flow diagrams that improves earlier approaches by reducing the number of edge crossings and bend points. We validate the quality of our algorithm with a range of models drawn from Ptolemy, a popular modeling tool for the design of embedded systems.

[1]  Helen C. Purchase,et al.  Which Aesthetic has the Greatest Effect on Human Understanding? , 1997, GD.

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

[3]  Christian Dziobek,et al.  Effizientes Erstellen von Simulink Modellen mit Hilfe eines Spezifisch angepassten Layoutalgorithmus , 2011, MBEES.

[4]  Martin Siebenhaller.  Orthogonal graph drawing with constraints: algorithms and applications , 2009 .

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

[6]  Falk Schreiber,et al.  Visualisierung biochemischer Reaktionsnetze , 2001 .

[7]  Edward A. Lee,et al.  Actor-Oriented Design of Embedded Hardware and Software Systems , 2003, J. Circuits Syst. Comput..

[8]  Dominique Fober,et al.  An Algebraic approach to Block Diagram Constructions , 2002 .

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

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

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

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

[13]  Xuemin Lin,et al.  A Fast and Effective Heuristic for the Feedback Arc Set Problem , 1993, Inf. Process. Lett..

[14]  Manfred Broy,et al.  Challenges in automotive software engineering , 2006, ICSE.

[15]  Vance E. Waddle,et al.  Graph Layout for Displaying Data Structures , 2000, Graph Drawing.

[16]  Gérard Assayag,et al.  New computational paradigms for computer music , 2009 .

[17]  Michael Jünger,et al.  Simple and Efficient Bilayer Cross Counting , 2002, J. Graph Algorithms Appl..

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

[19]  Dominique Fober,et al.  FAUST : an Efficient Functional Approach to DSP Programming , 2009 .

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

[21]  Petra Mutzel,et al.  Port Constraints in Hierarchical Layout of Data Flow Diagrams , 2009, GD.

[22]  Colin Ware,et al.  Cognitive Measurements of Graph Aesthetics , 2002, Inf. Vis..

[23]  Michael Forster.  A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction , 2004, Graph Drawing.