A New Approach for Visualizing UML Class Diagrams

Proceedings of ACM Symposium on Software Visualization

Volumn , Issue , 2003, Pages 179-188

  Gutwenger, Carsten ^a   Kupke, Joachim ^a   Jünger, Michael ^b   Leipert, Sebastian ^a   Klein, Karsten ^a   Mutzel, Petra ^c  

^a CENTER OF ADVANCED EUROPEAN STUDIES AND RESEARCH CAESAR   (Germany)

^b UNIVERSITY OF COLOGNE   (Germany)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Graph Drawing; Graph Layout; Software Visualization; UML Class Diagrams

Indexed keywords

COMPUTER GRAPHICS; COMPUTER SOFTWARE; HIERARCHICAL SYSTEMS; OBJECT ORIENTED PROGRAMMING;

CLASS DIAGRAMS;

SOFTWARE ENGINEERING;

EID: 0141998615     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/774833.774859     Document Type: Conference Paper

References (29)

1. BATTISTA, G. D., EADES, P., TAMASSIA, R., AND TOLLIS, I. 1999. Graph Drawing. Prentice Hall.
2. BERTOLAZZI, P., DI BATTISTA, G., MANNING, C., AND TAMASSIA, R. 1998. Optimal upward planarity testing of single-source digraphs. SIAM Journal on Computing 27, 1, 132-169.
3. BOOCH, G., RUMBAUGH, J., AND JACOBSON, I. 1999. Unified Modeling Language User Guide. Addison Wesley Longman.
4. BOOTH, K., AND LUEKER, G. 1976. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13, 335-379.
5. CHIBA, N., NISHIZEKI, T., ABE, S., AND OZAWA, T. 1985. A linear algorithm for embedding planar graphs using PQ-trees. Journal of Computer and System Sciences 30, 54-76.
6. DI BATTISTA, G., EADES, P., TAMASSIA, R., AND TOLLIS, I. G. 1998. Graph Drawing. Prentice Hall.
7. DI BATTISTA, G., DIDIMO, W., AND MARCANDALLI, A. 2002. Planarization of clustered graphs. In Graph Drawing (Proc. GD '01), Springer-Verlag, P. Mutzel, M. Jünger, and S. Leipert, Eds., vol. 2265 of Lecture Notes in Computer Science, 60-74.
8. EADES, P., AND KELLY, D. 1986. Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria 21, A, 89-98.
9. EICHELBERGER, H. 1999. Entwicklung eines Frameworks zum automatischen Zeichnen von Software-Entwurfsdiagrammen. Master's thesis, Universität Wüzburg.
10. EICHELBERGER, H. 2002. SugiBib, In Graph Drawing (Proc. GD '01), Springer-Verlag, P. Mutzel, M. Jünger, and S. Leipert, Eds., vol. 2265 of Lecture Notes in Computer Science, 467-468.
11. EIGLSPERGER, M., AND KAUFMANN, M. 2001. An approach for mixed upward planarization. In Proc. 7th International Workshop on Algorithms and Data Structures (WADS'01), Springer Verlag, vol. 2125 of Lecture Notes in Computer Science, 352-364.
12. FENG, Q.-W., COHEN, R. F., AND EADES, P. 1995. Planarity for clustered graphs. In Algorithms - ESA '95, Springer Verlag, P. Spirakis, Ed., vol. 979 of Lecture Notes in Computer Science, 213-226.
13. GANSNER, E. R., KOUTSOFIOS, E., NORTH, S. C., AND Vo, K. P. 1993. A technique for drawing directed graphs. IEEE Trans. Softw. Eng. 19, 3, 214-230.
14. GARG, A., AND TAMASSIA, R. 1995. On the computational complexity of upward and rectilinear planarity testing. In Graph Drawing (Proc. GD '94), Springer-Verlag, R. Tamassia and I. G. Tollis, Eds., vol. 894 of LNCS, 286-297.
15. GUTWENGER, C., MUTZEL, P., AND WEISKIRCHER, R. 2001. Inserting an edge into a planar graph. In Proceedings of the Twelwth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '01), ACM Press, 246-255.
16. GUTWENGER, C., JÜNGER, M., LEIPERT, S., MUTZEL, P., PERCAN, M., AND WEISKIRCHER, R. 2002. Advances in c-planarity testing of clustered graphs. In Graph Drawing (Proc. 2002), Springer-Verlag, M. Goodrich and S. Kobourov, Eds., vol. 2528 of Lecture Notes in Computer Science, 220-235.
17. HARARY, F. 1972. Graph Theory. Addison Wesley.
18. JÜNGER, M., AND MUTZEL, P. 1996. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications (JGAA) (http://www.cs.brown.edu/publications/jgaa/) 1, 1, 1-25.
19. JÜNGER, M., LEIPERT, S., AND MUTZEL, P. 1998. A note on computing a maximal planar subgraph using PQ-trees. IEEE Transactions on Computer-Aided Design 17, 7, 609-612.
20. KLAU, G. W., AND MUTZEL, P. 1998. Quasi-orthogonal drawing of planar graphs. Tech. Rep. MPI-I-98-1-013, Max-Planck-Institut für Informatik, Saarbrücken.
21. KLAU, G. W., KLEIN, K., AND MUTZEL, P. 2001. An experimental comparison of orthogonal compaction algorithms. In Graph Drawing (Proc. GD 2000), Springer, J. Marks, Ed., vol. 1984 of LNCS, 37-51.
22. LEMPEL, A., EVEN, S., AND CEDERBAUM, I. 1967. An algorithm for planarity testing of graphs. In Theory of Graphs: International Symposium: Rome, July 1966, Gordon and Breach, New York, 215-232.
23. PURCHASE, H., ALLDER, J.-A., AND CARRINGTON, D. 2001. User preference of graph layout aesthetics: A UML study. In Graph Drawing (Proc. GD 2000), Springer-Verlag, J. Marks, Ed., vol. 1984 of LNCS, 5-18.
24. RATIONAL SOFTWARE CORPORATION, 2002. Rational Rose, Rational XDE.
25. SEEMANN, J. 1997. Extending the sugiyama algorithm for drawing UML class diagrams. In Graph Drawing (Proc. GD '97), Springer-Verlag, G. Di Battista, Ed., vol. 1353 of LNCS, 415-424.
26. SUGIYAMA, K., TAGAWA, S., AND TODA, M. 1981. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man Cybern. SMC-11, 2, 109-125.
27. TAMASSIA, R., BATTISTA, G. D., AND BATINI, C. 1988. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern. SMC-18, 1, 61-79.
28. TAMASSIA, R. 1987. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16, 3, 421-444.
29. TOGETHERSOFT CORPORATION, 2002. Together ControlCenter.