A linear algorithm for embedding planar graphs using PQ-trees
Journal of Computer and System Sciences
On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Automatic graph drawing and readability of diagrams
IEEE Transactions on Systems, Man and Cybernetics
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
An O(m log n)-time algorithm for the maximal planar subgraph problem
SIAM Journal on Computing
An experimental study of the basis for graph drawing algorithms
Journal of Experimental Algorithmics (JEA)
Optimal Upward Planarity Testing of Single-Source Digraphs
SIAM Journal on Computing
The Unified Modeling Language user guide
The Unified Modeling Language user guide
Journal of the ACM (JACM)
Orthogonal graph drawing with constraints
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computing Orthogonal Drawings with the Minimum Number of Bends
IEEE Transactions on Computers
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
A Metrics Suite for Object Oriented Design
IEEE Transactions on Software Engineering
Drawing High Degree Graphs with Low Bend Numbers
GD '95 Proceedings of the Symposium on Graph Drawing
Which Aesthetic has the Greatest Effect on Human Understanding?
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
A Combinatorial Framework for Map Labeling
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Labeling Heuristics for Orthogonal Drawings
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Planarization of Clustered Graphs
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Disconnected Graph Layout and the Polyomino Packing Approach
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Computing Labeled Orthogonal Drawings
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Sketch-Driven Orthogonal Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Advances in C-Planarity Testing of Clustered Graphs
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Planarity for Clustered Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
On the Compuational Complexity of Upward and Rectilinear Planarity Testing
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
A new approach for visualizing UML class diagrams
Proceedings of the 2003 ACM symposium on Software visualization
A topology-shape-metrics approach for the automatic layout of UML class diagrams
Proceedings of the 2003 ACM symposium on Software visualization
VISSOFT '02 Proceedings of the 1st International Workshop on Visualizing Software for Understanding and Analysis
A note on computing a maximal planar subgraph using PQ-trees
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
SoftVis '06 Proceedings of the 2006 ACM symposium on Software visualization
A model-driven methodology to the content layout problem in web applications
ACM Transactions on the Web (TWEB)
Hi-index | 0.00 |
Unified modelling language (UML) diagrams have become increasingly important in engineering and re-engineering processes for software systems. Of particular interest are UML class diagrams whose purpose is to display generalizations, associations, aggregations, and compositions in one picture. The combination of directed and undirected relations poses a special challenge to a graph layout tool. Current approaches for the automatic layout of class diagrams are based on the layered graph drawing paradigm. These algorithms produce good results for class diagrams with large and deep structural information, that is, diagrams with a large and deep inheritance hierarchy. However, they do not perform satisfactorily in absence of this information. We suggest to use the topology-shape--metrics paradigm for automatic layout of class diagrams, which has been used very successfully for drawing undirected graphs in orthogonal style. Moreover, we introduce the algorithms UML-Kandinsky and GoVisual fitting into this paradigm. Both algorithms work for class diagrams with rich structural information as well as for class diagrams with few or no structural information. Therefore, they improve the existing algorithms significantly.