Improved Layout for Data Flow Diagrams with Port Constraints

  • Lars Kristian Klauske
  • Christoph Daniel Schulze
  • Miro Spönemann
  • Reinhard von Hanxleden
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7352)


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.


Output Port Input Port Outgoing Edge Incoming Edge Composite Actor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Barth, W., Jünger, M., Mutzel, P.: Simple and Efficient Bilayer Cross Counting. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 130–141. Springer, Heidelberg (2002), CrossRefGoogle Scholar
  2. 2.
    Broy, M.: Challenges in automotive software engineering. In: ICSE 2006: Proceedings of the 28th International Conference on Software Engineering, pp. 33–42 (2006)Google Scholar
  3. 3.
    Eades, P., Lin, X., Smyth, W.F.: A fast and effective heuristic for the feedback arc set problem. Information Processing Letters 47(6), 319–323 (1993)MathSciNetzbMATHCrossRefGoogle Scholar
  4. 4.
    Eker, J., Janneck, J.W., Lee, E.A., Liu, J., Liu, X., Ludvig, J., Neuendorffer, S., Sachs, S., Xiong, Y.: Taming heterogeneity—the Ptolemy approach. Proceedings of the IEEE 91(1), 127–144 (2003)CrossRefGoogle Scholar
  5. 5.
    Forster, M.: A Fast and Simple Heuristic for Constrained Two-Level Crossing Reduction. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 206–216. Springer, Heidelberg (2005), CrossRefGoogle Scholar
  6. 6.
    Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.P.: A technique for drawing directed graphs. Software Engineering 19(3), 214–230 (1993)CrossRefGoogle Scholar
  7. 7.
    Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM Journal on Algebraic and Discrete Methods 4(3), 312–316 (1983), MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Klauske, L.K., Dziobek, C.: Improving modeling usability: Automated layout generation for Simulink. In: Proceedings of the MathWorks Automotive Conference, MAC 2010 (2010)Google Scholar
  9. 9.
    Klauske, L.K., Dziobek, C.: Effizientes Erstellen von Simulink Modellen mit Hilfe eines spezifisch angepassten Layoutalgorithmus. In: Tagungsband Dagstuhl-Workshop MBEES: Modellbasierte Entwicklung eingebetteter Systeme VII, pp. 115–126 (2011),
  10. 10.
    Lee, E.A., Neuendorffer, S., Wirthlin, M.J.: Actor-oriented design of embedded hardware and software systems. Journal of Circuits, Systems, and Computers (JCSC) 12(3), 231–260 (2003)CrossRefGoogle Scholar
  11. 11.
    Orlarey, Y., Fober, D., Letz, S.: An algebraic approach to block diagram constructions. In: Actes des Journèes d’Informatique Musicale (JIM 2002), pp. 151–158. GMEM, Marseille (2002)Google Scholar
  12. 12.
    Orlarey, Y., Fober, D., Letz, S.: FAUST: an efficient functional approach to DSP programming. In: Assayag, G., Gerzso, A. (eds.) New Computational Paradigms for Computer Music. Editions Delatour, France (2009)Google Scholar
  13. 13.
    Purchase, H.C.: Which Aesthetic has the Greatest Effect on Human Understanding? In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 248–261. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  14. 14.
    Sander, G.: Graph layout through the VCG tool. Tech. Rep. A03/94, Universität des Saarlandes, FB 14 Informatik, 66041 Saarbrücken (October 1994)Google Scholar
  15. 15.
    Sander, G.: A Fast Heuristic for Hierarchical Manhattan Layout. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 447–458. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  16. 16.
    Sander, G.: Layout of Directed Hypergraphs with Orthogonal Hyperedges. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 381–386. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  17. 17.
    Schreiber, F.: Visualisierung biochemischer Reaktionsnetze. Ph.D. thesis, Universität Passau, Innstrasse 29, 94032 Passau (2001)Google Scholar
  18. 18.
    Siebenhaller, M.: Orthogonal Graph Drawing with Constraints: Algorithms and Applications. Ph.D. thesis, Universität Tübingen, Wilhelmstr. 32, 72074 Tübingen (2009)Google Scholar
  19. 19.
    Spönemann, M., Fuhrmann, H., von Hanxleden, R., Mutzel, P.: Port Constraints in Hierarchical Layout of Data Flow Diagrams. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 135–146. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  20. 20.
    Sugiyama, K., Misue, K.: Visualization of structural information: automatic drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics 21(4), 876–892 (1991)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man and Cybernetics 11(2), 109–125 (1981)MathSciNetCrossRefGoogle Scholar
  22. 22.
    Waddle, V.: Graph Layout for Displaying Data Structures. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 241–252. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  23. 23.
    Ware, C., Purchase, H., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Information Visualization 1(2), 103–110 (2002)CrossRefGoogle Scholar
  24. 24.
    Wernicke, M.: AUTOSAR auf dem Weg in die Serie. Elektronik Praxis 02 (2008),

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Lars Kristian Klauske
    • 1
  • Christoph Daniel Schulze
    • 2
  • Miro Spönemann
    • 2
  • Reinhard von Hanxleden
    • 2
  1. 1.Daimler Center for Automotive Information Technology InnovationsBerlinGermany
  2. 2.Real-Time and Embedded Systems GroupChristian-Albrechts-Universität zu KielGermany

Personalised recommendations