Automatic layout of uml class diagrams in orthogonal style

Information Visualization

Volumn 3, Issue 3, 2004, Pages 189-208

  Eiglsperger, Markus ^a   Gutwenger, Carsten ^b   Kaufmann, Michael ^a   Kupke, Joachim ^b   Jünger, Michael ^c   Leipert, Sebastian ^b   Klein, Karsten ^b   Mutzel, Petra ^d   Siebenhaller, Martin ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

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

^c UNIVERSITY OF COLOGNE   (Germany)

^d VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

graph drawing; graph layout; Software visualization; UML class diagram

Indexed keywords

EID: 84997909569     PISSN: 14738716     EISSN: 14738724     Source Type: Journal    
DOI: 10.1057/palgrave.ivs.9500078     Document Type: Article

References (61)

1. Booch G, Rumbaugh J, Jacobson I. Unified Modeling Language User Guide. Addison-Wesley, Longman: Reading MA, 1999.
2. Purchase H, Allder J-A, Carrington D. User preference of graph layout aesthetics: A UML study. In: Marks J (Ed), Graph Drawing (Proc. GD 2000). Lecture Notes in Computer Science, Vol. 1984 Springer-Verlag: Berlin, 2001; 5–18.
3. Purchase HC. Which aesthetic has the greatest effect on human understanding?. In: Proceedings of the 5th International Symposium on Graph Drawing (GD1997). Vol. 1353, Springer: Berlin, 1997; 248–261.
4. Purchase HC, Cohen RF, James M. An experimental study of the basis for graph drawing algorithms. ACM Journal of Experimental Algorithmics, 1997; 2: 4.
5. Eichelberger H. Aesthetics of class diagrams. In: Proceedings of the First IEEE International Workshop on Visualizing Software for Understanding and Analysis, Vissoft, 2002; 2002: 23–31.
6. Rational Software Corporation Rational Rose, Rational XDE, 2002.
7. TogetherSoft Corporation Together Control Center. 2002.
8. Seemann J. Extending the sugiyama algorithm for drawing UML class diagrams. In: Di Battista G (Ed), Graph Drawing (Proc. GD 1997). Vol. 1353, Springer: Berlin, 1997; 415–424.
9. Sugiyama K, Tagawa S, Toda M. Methods for visual understanding of hierarchical systems. IEEE Transations on System, Man and Cybernetics, 1981; SMC-11: 109–125.
10. Eichelberger H. SugiBib. In: MutzelP, JüngerM, LeipertS, (Eds.). Graph Drawing (Proc GD 1901). Lecture Notes in Computer Science, Vol. 2265, Springer-Verlag: Berlin, 2002; 467–468.
11. Eichelberger H. Entwicklung eines Frameworks zum automatischen Zeichnen von Software-Entwurfsdiagrammen. Master's thesis, Universität Wüzburg, 1999.
12. Gamma E, Helm R, Johnson R, Vlissides J. Design Patterns. Addison-Wesley: Reading, MA, 1995.
13. Booch G. Object Oriented Design and Analysis. Addison-Wesley: Reading MA, 1994.
14. Chidamber S, Kemerer C. A metrics suite for object oriented design. IEEE Transactions on Software Engineering, 1994; 20: 467–493.
15. Harary F. Graph Theory. Addison-Wesley: Reading, MA, 1972.
16. Di Battista G, Eades P, Tamassia R, Tollis IG. Graph Drawing. Prentice-Hall: Englewood Cliffs, NJ, 1998.
17. Tamassia R, Battista GD, Batini C. Automatic graph drawing and readability of diagrams. IEEE Transations on System, Man and Cybernetics, 1998; SMC-18: 61–79.
18. Lempel A, Even S, Cederbaum I. An algorithm for planarity testing of graphs. In: Theory of Graphs: International Symposium (Rome). Gordon and Breach: New York, 1967; 215–232.
19. Booth K, Lueker G. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences, 1976; 13: 335–379.
20. Hopcroft J, Tarjan RE. Efficient planarity testing. Journalof ACM, 1974; 21: 549–568.
21. Chiba N, Nishizeki T, Abe S, Ozawa T. A linear algorithm for embedding planar graphs using PQ-trees. Journal of Computer and System Sciences, 1985; 30: 54–76.
22. Mehlhorn K, Mutzel P. On the embedding phase of the Hopcoft and Tarjan planarity testing algorithm. Algorithmica, 1996; 16: 233–242.
23. Liu PC, Geldmacher RC. On the deletion of nonplanar edges of a graph. In: Proceedings of the 10th Southeastern Conference on Combinatorics, Graph Theory, and Computing, 1977; 727–738.
24. Jünger M, Mutzel P. Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica, Special Issue on Graph Drawing, 1996; 16: 33–59.
25. Cai J, Han X, Tarjan RE. An O(m log n)-time algorithm for the maximal planar subgraph problem. SIAM Journal on Computing, 1993; 22: 1142–1162.
26. Jünger M, Leipert S, Mutzel P. A note on computing a maximal planar subgraph using PQ-trees. IEEE Transactions on Computer-Aided Design, 1998; 17: 609–612.
27. Gutwenger C, Mutzel P. An experimental study of crossing minimization heuristics. In: Liotta G (Ed), Graph Drawing (Proc. GD 1903). Lecture Notes in Computer Science. Vol. 2912, Springer-Verlag: Berlin, 2004; 2912: 13–24.
28. Tamassia R. On embedding a graph in the grid with the minimum number of bends. SIAM Journal of Computing, 1987; 16: 421–444.
29. Garg A, Tamassia R. On the complexity of upward and rectilinear planarity testing. In: Proceedings of the 2nd International Symposium on Graph Drawing (GD1994). Lecture Notes in Computer Science, Vol. 894, Springer: Berlin, 1995; 286–297.
30. Fössmeier U, Kaufmann M. Drawing high degree graphs with low bend numbers. In: Brandenburg FJ (Ed), Proceedings of the 3rd International Symposium on Graph Drawing (GD1995). Vol. 1027, Springer: Berlin, 1996; 254–266.
31. Bertolazzi P, Battista GD, Didimo W. Computing orthogonal drawings with the minimum number of bends. IEEE Transactions on Computers, 2000; 49: 826–840.
32. Mutzel P, Weiskircher R. Computing optimal embeddings for planar graphs. In: DuD-Z, EadesP, Estivill-CastroV, LinX, SharmaA, (Eds.). Computing and Combinatorics Proceedings of the Sixth Annual International Conference (COCOON 192000). Lecture Notes in Computer Science, Vol. 1858, Springer-Verlag: Berlin, 2000; 95–104.
33. Patrignani M. On the complexity of orthogonal compaction. Technical. Report. RT-DIA-39–99, Dipartimento di Informatica e Automazione, Università degli Studi di Roma Tre, January, 1999.
34. Klau GW, Klein K, Mutzel P. An experimental comparison of orthogonal compaction algorithms. In: Marks J (Ed), Graph Drawing (Proc. GD 2000). Lecture Notes in Computer Science, Vol. 1984, Springer: Berlin, 2001; 37–51.
35. Di Battista G, Didimo W, Patrignani M, Pizzonia M. Orthogonal and quasi-upward drawings with vertices of prescribed size. In: Proceedings of the 7th International Symposium on Graph Drawing (GD1999). Lecture Notes in Computer Science, Kratochvil J (Ed), Vol. 1731, Springer: Berlin, 1999; 297–310.
36. Eiglsperger M, Kaufmann M. Fast compaction for orthogonal drawings with vertices of prescribed size. In: Proceedings of the 9th International Symposium on Graph Drawing (GD192001). Vol. 2265, Springer: Berlin, 2001; 124–138.
37. Bertolazzi P, Di Battista G, Mannino C, Tamassia R. Optimal upward planarity testing of single-source digraphs. SIAM Journal on Computing, 1998; 27: 132–169.
38. Bertolazzi P, Battista GD, Didimo W. Quasi-upward planarity. Algorithmica, 2002; 32: 474–506.
39. Eiglsperger M, Kaufmann M, Eppinger F. An approach for mixed upward planarization. Journal of Graph Algorithms and Applications, 2003; 7: 203–220.
40. Eiglsperger M, Foessmeier U, Kaufmann M. Orthogonal graph drawing with constraints. In: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, 2000; 3–11.
41. Wagner F, Wolff A. A combinatorial framework for map labeling. In: Proceedings of the 6th International Symposium on Graph Drawing (GD1998). Lecture Notes in Computer Science, Vol. 1547, Springer: Berlin, 1998; 316–331.
42. Klau GW, Mutzel P. Optimal labelling of point features in the slider model. In: DuD-Z, EadesP, Estivill-CastroV, LinX, SharmaA, (Eds.). Computing and Combinatorics, Proceedings of the Sixth Annual International. Conference. (COCOON 192000). Lecture Notes in Computer Science, Vol. 1858, Springer-Verlag: Berlin, 2000; 340–350.
43. Klau GW, Mutzel P. Combining graph labeling and compaction. In: Kratochvil J (Ed), Proceedings of the 7th International Symposium on Graph Drawing (GD1999). Lecture Notes in Computer Science, Vol. 1731, Springer: Berlin, 1999; 27–37.
44. Binucci C, Didimo W, Liotta G, Nonato M. Labeling heuristics for orthogonal drawings. In: Proceedings of the 9th International Symposium on Graph Drawing (GD192001), Lecture Notes in Computer Science. Vol. 2275, Springer: Berlin, 2001; 139–153.
45. Binucci C, Didimo W, Liotta G, Nonato M. Computing labeled orthogonal drawings. In: Proceedings of the 10th International Symposium on Graph Drawing (GD192002). Lecture Notes in Computer Science, Vol. 2528, Springer: Berlin, 2002; 66–73.
46. Feng Q-W, Cohen RF, Eades P. Planarity for clustered graphs. In: Spirakis P (Ed), Algorithms - ESA 1995. Lecture Notes in Computer Science, Vol. 979, Springer Verlag: Berlin, 1995; 213–226.
47. Gutwenger C, Jünger M, Leipert S, Mutzel P, Percan M, Weiskircher R. Advances in c-planarity testing of clustered graphs. In: GoodrichM, KobourovS, (Eds.). Graph Drawing (Proc. 2002). Lecture Notes in Computer Science, Vol. 2528, Springer-Verlag: Berlin, 2002; 220–235.
48. DiBattista G, Didimo W, Marcandalli A. Planarization of clustered graphs. In: MutzelP, JüngerM, LeipertS, (Eds.). Graph Drawing (Proc. GD 1901). Lecture Notes in Computer Science, Vol. 2265, Springer-Verlag: Berlin, 2002; 60–74.
49. Lütke-Hüttemann D. Knickminimales Zeichnen 4-planarer Clustergraphen. Master's thesis, Universität des Saarlands. 1977.
50. Eiglsperger M, Kaufmann M, Siebenhaller M. A topology-shapemetrics approach for the automatic layout of uml class diagrams. In: Proceedings of The ACM 2003 Symposium on Software Visualization. ACM: New York, 2003; 189–198.
51. OMG. Unified Modeling Language v1.4. http://www.omg.org/technology/documents/formal/uml.htm, 2001.
52. Lengauer T. Combinatorial Algorithms for Integrated Circuit Layout. Applicable Theory in Computer Science. Wiley-Teubner: New York, 1990.
53. Freiwalds K, Dogrusoz U, Kikusts P. Disconnected graph layout and the polyomino packing approach. In: Proceedings of the 9th International Symposium on Graph Drawing (GD192001). Lecture Notes in Computer science, Vol. 2265, Springer: Berlin, 2001; 378–391.
54. Brandes U, Eiglsperger M, Kaufmann M, Wagner D. Sketch-driven orthogonal graph drawing. In: Proceedings of the 10th International Symposium on Graph Drawing (GD192002). Vol. 2528, Springer: Berlin, 2002; 1–12.
55. Wiese R, Eiglsperger M, Kaufmann M. yfiles: visualization and automatic layout of graphs. In: Proceedings of the 9th International Symposium on Graph Drawing (GD1901). Lecture Notes in Computer Science, Springer: Berlin, 2001; 453–454.
56. Eades P, Kelly D. Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria, 1986; 21: 89–98.
57. Gansner ER, Koutsofios E, North SC, Vo KP. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 1993; 19: 214–230.
58. Jünger M, Mutzel P. 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/), 1996; 1: 1–25.
59. Klau GW, Mutzel P. Quasi-orthogonal drawing of planar graphs. Technical. Report. MPI-I-98–1–013, Max-Planck-Institut für Informatik, Saarbrücken. 1998.
60. Gutwenger C, Klein K, Kupke J, Leipert S, Jünger M, Mutzel P. Govisual software tools. http://www.oreas.de, 2002.
61. Gutwenger C, Junger M, Klein K, Kupka J, Leiperh S, Mutzel P. A new approach for visualizing uml class diagrams. In: Proceedings of the ACM 2003 Symposium on Software Visualization. ACM: New York, 2003; 179–188.