Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
A fast and effective heuristic for the feedback arc set problem
Information Processing Letters
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
Design Patterns: Abstraction and Reuse of Object-Oriented Design
ECOOP '93 Proceedings of the 7th European Conference on Object-Oriented Programming
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Graph Layout for Displaying Data Structures
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Fast and Simple Horizontal Coordinate Assignment
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Simple and Efficient Bilayer Cross Counting
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Cognitive measurements of graph aesthetics
Information Visualization
Challenges in automotive software engineering
Proceedings of the 28th international conference on Software engineering
Practical level planarity testing and layout with embedding constraints
GD'07 Proceedings of the 15th international conference on Graph drawing
An efficient implementation of sugiyama's algorithm for layered graph drawing
GD'04 Proceedings of the 12th international conference on Graph Drawing
A fast and simple heuristic for constrained two-level crossing reduction
GD'04 Proceedings of the 12th international conference on Graph Drawing
Port constraints in hierarchical layout of data flow diagrams
GD'09 Proceedings of the 17th 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
| Hi-index | 0.00 |
Complex software systems are often modeled using data flow diagrams, in which nodes are connected to each other through dedicated connection points called ports. The influence a layout algorithm has on the placement of ports is determined by port constraints defined on the corresponding node. In this paper we present approaches for integrating port constraints into the layer-based approach to graph drawing pioneered by Sugiyama et al. We show how our layout algorithm, called KLay Layered, progresses from relaxed to more restricted port constraint levels as it executes, and how established algorithms for crossing minimization and edge routing can be extended to support port constraints. Compared to the previous layout algorithms supporting ports, our algorithm produces fewer edge crossings and bends and yields pleasing results. We also explain and evaluate how layout algorithms can be kept simple by using the concept of intermediate processors to structure them in a modular way. A case study integrating our layout algorithm into UC Berkeley's Ptolemy tool illustrates how KLay Layered can be integrated into Java-based applications.