Extending the Sugiyama Algorithm for Drawing UML Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams

Seemann, Jochen (1998) Extending the Sugiyama Algorithm for Drawing UML Class Diagrams: Towards Automatic Layout of Object-Oriented Software Diagrams. In: Graph Drawing 5th International Symposium, GD '97, September 18-20, 1997, Rome, Italy , pp. 415-424 (Official URL: http://dx.doi.org/10.1007/3-540-63938-1_86).

Full text not available from this repository.

Abstract

The automatic layout of software diagrams is a very attractive graph drawing application for use in software tools. Object-oriented software may be modelled using a visual language called the Unified Modeling Laguage (UML). In this paper we present an algorithm for the automatic layout of UML class diagrams using an extension of the Sugiyama algorithm together with orthogonal drawing. These diagrams visualize the static structure of object-oriented software systems and are characterised by the use of two main types of edges corresponding to different relationships between the classes. The graph drawing algorithm accounts for these concepts by treating the different edge types in different ways.

Item Type:Conference Paper
Additional Information:10.1007/3-540-63938-1_86
Classifications:P Styles > P.480 Layered
P Styles > P.600 Poly-line > P.600.700 Orthogonal
ID Code:154

Repository Staff Only: item control page

References

G. Booch: Object-Oriented Design, Benjamin/Cummings Publishing, 1991.

F.J. Brandenburg, editor: Proceedings of Graph Drawing '95, Vol. 1027 of Lecture Notes in Computer Science, Springer Verlag, 1996.

G. Di Battista, P. Eades, R. Tamassia, I.G. Tollis: Algorithms for drawing graphs: an Annotated Bibliography, Comput. Geometry Theory Appl., 4:235-282, 1994.

Peter Eades, Kozo Sugiyama: How to draw a directed graph, Journal of Information Processing, 14(4):424-437, 1990.

A. Fick: Upper bounds on the Number of Hidden Nodes in the Sugiyama Algorithm in [8], pp. 169-183.

E.R. Ganser, E. Koutsofios, S. North, K.-P.Vo: A technique for drawing directed graphs, IEEE Transactions on Software Engineering, 19(3): 241-230, March 1993

F. Newbery-Paulisch, W.F. Tichy: Edge: An extendible graph editor, Software - Practice and Experience, 20(1):63-88, June 1990

S. North, editor: Proceedings of Graph Drawing '96, Vol. 1190 of Lecture Notes in Computer Science, Springer Verlag, 1997

P. Mutzel: An Alternative Method to Crossing Minimization on Hierarchical Graphs, in [8], pp. 318-333

J. Rumbaugh, M. Blaha, W. Premerlani, F. Eddy, W. Lorenson: Object-Oriented Modeling and Design, Prentice-Hall, 1991

G. Sander: A Fast Heuristic for Hierarchical Manhattan Layout, in [2], pp. 447-458

J. Seemann, J. Wolff von Gudenberg: OMTskript - eine Programmiersprache für objekt-orientierten Software-Entwurf, Technical Report, Department of Computer Science, Würzburg University, 1997.

Kozo, Sugiyama, Shojiro Tagawa, and Mitsuhiko, Toda: Methods for visual understanding of hierachical system structures, IEEE Transactions on Systems, Man, and Cybernetics SMC-11(2): 109-125, February 1981

Rational Software Corporation: The Unified Modeling Language 1.0, only available via WWW: http://www.rational.com, January 1997

J. Warfield: Crossing Theory and Hierarchy Mapping, IEEE Transactions on Systems, Man, and Cybernetics SMC-7(7): 505-523, July 1977