A Topology-Shape-Metrics Approach for the Automatic Layout of UML Class Diagrams

Proceedings of ACM Symposium on Software Visualization

Volumn , Issue , 2003, Pages 189-198

  Eiglsperger, Markus ^a   Kaufmann, Michael ^a   Siebenhaller, Martin ^a  

^a NONE

Author keywords

Graph drawing; UML Diagrams

Indexed keywords

ALGORITHMS; COMPUTER GRAPHICS; COMPUTER SOFTWARE; OBJECT ORIENTED PROGRAMMING; TOPOLOGY;

CLASS DIAGRAMS;

SOFTWARE ENGINEERING;

EID: 0141929374     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/774833.774860     Document Type: Conference Paper

References (37)

1. BATTISTA, G. D., DIDIMO, W., PATRIGNANI, M., AND PIZZONIA, M. 1999. Orthogonal and quasi-upward drawings with vertices of prescribed size. In Proceedings of the 7th International Symposium on Graph Drawing (GD'99), Springer, J. Kratochvil, Ed., vol. 1731 of LNCS, 297-310.
2. BATTISTA, G. D., DIDIMO, W., AND MARCANDALLI, A. 2001, Planarization of clustered graphs. In Proceedings of the 9th International Symposium on Graph Drawing (GD'2001), vol. 2275 of LNCS, 60-74.
3. BERTOLAZZI, P., BATTISTA, G. D., AND DIDIMO, W. 2000. Computing orthogonal drawings with the minimum number of bends. IEEE Transactions on Computers 49, 8, 826-840.
4. BERTOLAZZI, P., BATTISTA, G. D., AND DIDIMO, W. 2002. Quasi-upward planarity. Algorithmica 32, 3, 474-506.
5. BINUCCI, C., DIDIMO, W., LIOTTA, G., AND NONATO, M. 2001. Labeling heuristics for orthogonal drawings. In Proceedings of the 9th International Symposium on Graph Drawing (GD '2001), vol. 2275 of LNCS, 139-153.
6. BINUCCI, C., DIDIMO, W., LIOTTA, G., AND NONATO, M. 2002. Computing labeled orthogonal drawings. In Proceedings of the 10th International Symposium on Graph Drawing (GD'2002), vol. 2528 of LNCS, 66-73.
7. BOOCH, G., RUMBAUGH, J., AND JACOBSON, I. 1999. The Unified Modeling Language User Guide, Addison-Wesley.
8. BOOCH, G. 1994. Object Oriented Design and Analysis. Addison-Wesley.
9. BRANDES, U., EIGLSPERGER, M., KAUFMANN, M., AND WAGNER, D. 2002. Sketch-driven orthogonal graph drawing. In Proceedings of the 10th International Symposium on Graph Drawing (GD'2002), Springer, vol. 2528, 1-12.
10. CHIDAMBER, S., AND KEMERER, C. 1994. A metrics suite for object oriented design. IEEE Transactions on Software Engineering 20, 6, 467-493.
11. COFFMAN, E. G., AND GRAHAM, R. L. 1972. Optimal scheduling for two processor systems. Acta Informatica 1, 200-213.
12. DI BATTISTA, G., EADES, P., TAMASSIA, R., AND TOLLIS, I. G. 1999. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall.
13. EICHELBERGER, H. 2000. Automatisches Zeichnen von UML Klassendiagrammen mit dem Sugiyama-Algorithmus in Tagungsband des GI-Workshops Softwarevisualisierung 2000. Tech. Rep. A/01/2000, Universität des Saarlandes.
14. EICHELBERGER, H. 2002. Aesthetics of class diagrams. In Proc. of the First IEEE International Workshop on Visualizing Software for Understanding and Analysis, Vissoft 2002, 23-31.
15. EIGLSPERGER, M., AND KAUFMANN, M. 2001. An approach for mixed upward planarization. In Proceedings of the 7th International Workshop on Algorithms and Datastructures (WADS 2001), Springer, 352-364.
16. EIGLSPERGER, M., AND KAUFMANN, M. 2001. Fast compaction for orthogonal drawings with vertices of prescribed size. In Proceedings of the 9th International Symposium on Graph Drawing (GD'2001), Springer, vol. 2265, 124-138.
17. EIGLSPERGER, M., AND KAUFMANN, M. 2002. An approach for mixed upward planarization. Journal of Graph Algorithms and Applications, submitted.
18. EIGLSPERGER, M., FOESSMEIER, U., AND KAUFMANN, M. 2000. Orthogonal graph drawing with constraints. In Proc. 11th ACM-SIAM Symposium on Discrete Algorithms, 3-11.
19. FENG, Q.-W., COHEN, R. F., AND EADES, P. 1995. Planarity for clustered graphs. In Proceedings of the 3rd European Symposium on Algorithms (ESA'95), Springer, vol. 979 of LNCS, 213-226.
20. FÖSSMEIER, U., AND KAUFMANN, M. 1996. Drawing high degree graphs with low bend numbers. In Proceedings of the 3rd International Symposium on Graph Drawing (GD'95), Springer, F. J. Brandenburg, Ed., vol. 1027 of LNCS, 254-266.
21. FREIWALDS, K., DOGRUSOZ, U., AND KIKUSTS, P. 2001. Disconnected graph layout and the polyomino packing approach. In Proceedings of the 9th International Symposium on Graph Drawing (GD'2001), Springer, vol. 2265 of LNCS, 378-391.
22. GAMMA, E., HELM, R., JOHNSON, R., AND VLISSIDES, J. 1995. Design Patterns. Addison-Wesley.
23. GUTWENGER, C., JÜNGER, M., KLEIN, K., KUPKE, J., LEIPERT, S., AND MUTZEL, P. 2002. Caesar automatic layout of uml class diagrams. In Proceedings of the 9th International Symposium on Graph Drawing (GD 2001), Springer, vol. 2265 of LNCS.
24. KLAU, G. W., AND MUTZEL, P. 1999. Combining graph labeling and compaction. In Proceedings of the 7th International Symposium on Graph Drawing (GD'99), Springer, J. Kratochvil, Ed., no. 1731 in LNCS, 27-37.
25. KLAU, G. W., KLEIN, K., AND MUTZEL, P. 2001. An experimental comparison of orthogonal compaction algorithms. In Proceedings of the 8th International Symposium on Graph Drawing (GD'2000), no. 1984 in LNCS, 37-51.
26. LENGAUER, T. 1990. Combinatorial Algorithms for Integrated Circuit Layout. Applicable Theory in Computer Science. Wiley-Teubner.
27. LÜTKE-HÜTTEMANN, D. 1999. Knickminimales Zeichnen 4-planarer Clustergraphen. Master's thesis, Universität des Saarlands.
28. OMG, 2001. Unified Modeling Language v1.4. http://www. omg.org/technology/documents/formal/uml.htm.
29. PURCHASE, H. C., COHEN, R. F., AND JAMES, M. 1997. An experimental study of the basis for graph drawing algorithms. ACM Journal of Experimental Algorithmics 2, 4.
30. PURCHASE, H. C., ALLDER, J. A., AND CARRINGTON, D. 2000, User preference of graph layout aesthetics: A uml study. In Proceedings of the 8th International Symposium on Graph Drawing (GD'2000), Springer, vol. 1984 of LNCS, 5-18.
31. PURCHASE, H. C., McGILL, M., COLPOYS, L., AND CARRINGTON, D. 2001. Graph drawing aesthetics and the comprehension of uml class diagrams: an empirical study". In Proceedings of the Australian Symposium on Information Visualization, Australian Computer Society Inc., vol. 9.
32. PURCHASE, H. C. 1997. Which aesthetic has the greatest effect on human understanding ? In Proceedings of the 5th International Symposium on Graph Drawing (GD'97), vol. 1353 of LNCS, 248-261.
33. SEEMANN, J. 1997. Extending the Sugiyama algorithm for drawing UML class diagrams: Towards automatic layout of objectoriented software diagrams. In Proceedings of the 5th International Symposium on Graph Drawing (GD'97), vol. 1353 of LNCS, 415-424.
34. SUGIYAMA, K., TAGAWA, S., AND TODA, M. 1981. Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics 11, 2 (February), 109-125.
35. TAMASSIA, R. 1987. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing 16, 3, 421-444.
36. WAGNER, F., AND WOLFF, A. 1998. A combinatorial framework for map labeling. In Proceedings of the 6th International Symposium on Graph Drawing (GD'98), Springer, no. 1547 in LNCS, 316-331.
37. WIESE, R., EIGLSPERGER, M., AND KAUFMANN, M. 2001. yfiles: Visualization and automatic layout of graphs. In Proceedings of the 9th International Symposium on Graph Drawing (GD'01), Springer, LNCS, 453-454.