Port Constraints in Hierarchical Layout of Data Flow Diagrams

Spönemann, Miro and Fuhrmann, Hauke and Von Hanxleden, Reinhard and Mutzel, Petra (2010) Port Constraints in Hierarchical Layout of Data Flow Diagrams. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 135-146 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_14).

Full text not available from this repository.


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. 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.

Item Type:Conference Paper
Additional Information:10.1007/978-3-642-11805-0_14
Classifications:P Styles > P.600 Poly-line > P.600.700 Orthogonal
S Software and Systems > S.120 Visualization
P Styles > P.420 Hyper
ID Code:1108

Repository Staff Only: item control page


Arya, A., Kumar, A., Swaminathan, V.V., Misra, A.: Automatic generation of digital system schematic diagrams. In: DAC 1985: Proceedings of the 22nd ACM/IEEE Conference on Design Automation, pp. 388–395. ACM, New York (1985)

Baburin, D.E.: Using graph based representations in reengineering. In: Proceedings of the Sixth European Conference on Software Maintenance and Reengineering, pp. 203–206 (2002)

Batini, C., Nardelli, E., Tamassia, R.: A layout algorithm for data flow diagrams. IEEE Transactions on Software Engineering 12(4), 538–546 (1986)

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

Chapin, N.: Some structured analysis techniques. SIGMIS Database 10(3), 16–23 (1978)

Davis, A.L., Keller, R.M.: Data flow program graphs. Computer 15(2), 26–41 (1982)

Doorley, M., Cahill, A.: Experiences in automatic leveling of data flow diagrams. In: WPC 1996: Proceedings of the 4th International Workshop on Program Comprehension, pp. 218–229. IEEE Computer Society, Los Alamitos (1996)

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)

Eschbach, T.: Visualisierungen im Schaltkreisentwurf. PhD thesis, Institut für Informatik, Albert-Ludwigs-Universität Freiburg (June 2008)

Eschbach, T., Guenther, W., Becker, B.: Orthogonal hypergraph drawing for improved visibility. Journal of Graph Algorithms and Applications 10(2), 141–157 (2006)

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

Lageweg, C.R.: Designing an automatic schematic generator for a netlist description. Technical Report 1-68340-44(1998)03, Laboratory of Computer Architecture and Digital Techniques (CARDIT), Delft University of Technology, Faculty of Information Technology and Systems (1998)

Prochnow, S., von Hanxleden, R.: Statechart development beyond WYSIWYG. In: Engels, G., Opdyke, B., Schmidt, D.C., Weil, F. (eds.) MODELS 2007. LNCS, vol. 4735, pp. 635–649. Springer, Heidelberg (2007)

Sander, G.: Graph layout through the VCG tool. Technical Report A03/94, Universität des Saarlandes, FB 14 Informatik, 66041 Saarbrücken (October 1994)

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)

Sander, G.: Layout of compound directed graphs. Technical Report A/03/96, Universität des Saarlandes, FB 14 Informatik, 66041 Saarbrücken (June 1996)

Sander, G.: Layout of directed hypergraphs with orthogonal hyperedges. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 381–386. Springer, Heidelberg (2004)

Sander, G., Vasiliu, A.: The ILOG JViews graph layout module. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 438–439. Springer, u Heidelberg (2002)

Spönemann, M.: On the automatic layout of data flow diagrams. Diploma thesis, Christian-Albrechts-Universität zu Kiel, Department of Computer Science (March a 2009), http://rtsys.informatik.uni-kiel.de/~biblio/downloads/theses/ msp-dt.pdf

Spönemann, M., Fuhrmann, H., von Hanxleden, R.: Automatic layout of data o flow diagrams in KIELER and Ptolemy II. Technical Report 0914, ChristianAlbrechts-Universität zu Kiel, Department of Computer Science (July 2009), http://rtsys.informatik.uni-kiel.de/~biblio/downloads/papers/ report-0914.pdf

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)

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)

Wiese, R., Eiglsperger, M., Kaufmann, M.: yFiles: Visualization and automatic layout of graphs. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, u vol. 2265, pp. 588–590. Springer, Heidelberg (2002)