A Layout algorithm for data flow diagrams
IEEE Transactions on Software Engineering
Automatic generation of digital system schematic diagrams
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
A Fast Heuristic for Hierarchical Manhattan Layout
GD '95 Proceedings of the Symposium on Graph Drawing
Using Graph Based Representations in Reengineering
CSMR '02 Proceedings of the 6th European Conference on Software Maintenance and Reengineering
Experiences in Automatic Leveling of Data Flow Diagrams
WPC '96 Proceedings of the 4th International Workshop on Program Comprehension (WPC '96)
Some structured analysis techniques
ACM SIGMIS Database
Computer
Statechart development beyond WYSIWYG
MODELS'07 Proceedings of the 10th international conference on Model Driven Engineering Languages and Systems
Crossing minimization and layouts of directed hypergraphs with port constraints
GD'10 Proceedings of the 18th international conference on Graph drawing
Improved layout for data flow diagrams with port constraints
Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
Aesthetic layout of wiring diagrams
Diagrams'12 Proceedings of the 7th international conference on Diagrammatic Representation and Inference
Drawing layered graphs with port constraints
Journal of Visual Languages and Computing
Hi-index | 0.00 |
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.