Port constraints in hierarchical layout of data flow diagrams

  • Authors:
  • Miro Spönemann;Hauke Fuhrmann;Reinhard von Hanxleden;Petra Mutzel

  • Affiliations:
  • Real-Time and Embedded Systems Group, Christian-Albrechts-Universität zu Kiel;Real-Time and Embedded Systems Group, Christian-Albrechts-Universität zu Kiel;Real-Time and Embedded Systems Group, Christian-Albrechts-Universität zu Kiel;Chair of Algorithm Engineering, Technische Universität Dortmund

  • Venue:
  • GD'09 Proceedings of the 17th international conference on Graph Drawing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.