On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Combinatorial algorithms for integrated circuit layout
Combinatorial algorithms for integrated circuit layout
An experimental study of the basis for graph drawing algorithms
Journal of Experimental Algorithmics (JEA)
The Unified Modeling Language user guide
The Unified Modeling Language user guide
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
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Graph drawing aesthetics and the comprehension of UML class diagrams: an empirical study
APVis '01 Proceedings of the 2001 Asia-Pacific symposium on Information visualisation - Volume 9
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
Planarity for Clustered Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
VISSOFT '02 Proceedings of the 1st International Workshop on Visualizing Software for Understanding and Analysis
Automatic layout of UML class diagrams in orthogonal style
Information Visualization - Special issue: Software visualization
CVSscan: visualization of code evolution
SoftVis '05 Proceedings of the 2005 ACM symposium on Software visualization
Reconciling diagrams after executing model transformations
Proceedings of the 2006 ACM symposium on Applied computing
Visual assessment of software evolution
Science of Computer Programming
Visual Analytics: Visual data mining and analysis of software repositories
Computers and Graphics
Creating and reconciling diagrams after executing model transformations
Science of Computer Programming
Creating and reconciling diagrams after executing model transformations
Science of Computer Programming
Proceedings of the 4th ACM symposium on Software visualization
Automatic layout of UML use case diagrams
Proceedings of the 4th ACM symposium on Software visualization
Towards readable layouts for modeling data warehouses
DOLAP '10 Proceedings of the ACM 13th international workshop on Data warehousing and OLAP
Human-centered visualization environments
Human-centered visualization environments
Process model generation from natural language text
CAiSE'11 Proceedings of the 23rd international conference on Advanced information systems engineering
Hi-index | 0.00 |
Class diagrams are among the most popular visualizations for object oriented software systems and have a broad range of applications. In many settings it is desirable that the placement of the diagram elements is determined automatically, especially when the diagrams are generated automatically which is usually the case in reverse engineering. For this reason the automatic layout of class diagram gained importance in the last years. Current approaches for the automatic layout of class diagrams are based on the hierarchic graph drawing paradigm. These algorithms produce good results for class diagrams with large and deep structural information, i.e., diagrams with a large and deep inheritance hierarchy. However, they do not perform satisfactorily in absence of this information. We propose in this work a new algorithm for automatic layout of class diagram which is based on the topology-shape-metrics approach. The algorithm is an adaption of sophisticated graph drawing algorithms which have proven their effectiveness in many applications. The algorithm works as well for class diagrams with rich structural information as for class diagrams with few or no structural information. It improves therefore the existing algorithms significantly. An implementation of the algorithm is used in the reverse engineering tool JarInspector.