Skip to main content
Springer Nature Link
Log in

A Diagramming Software for UML Class Diagrams

  • Chapter
Graph Drawing Software

Part of the book series: Mathematics and Visualization ((MATHVISUAL))

  • 1251 Accesses

Abstract

UML diagrams have become increasingly important in the engineering and reengineering processes for software systems. Of particular interest are UML class diagrams whose purpose is to display class hierarchies (generalizations), associations, aggregations, and compositions in one picture. The combination of hierarchical and non-hierarchical relations poses a special challenge to a graph layout tool.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Di Battista, G., Eades, P., Tamassia, R., Tollis, I. G. (1999) Graph Drawing. Prentice Hall

    Google Scholar 

  2. Bertolazzi, P., Di Battista, G., Mannino, C., Tamassia, R. (1998) Optimal upward planarity testing of single-source digraphs. SI AM Journal on Computing 27(1), 132–169

    Article  MATH  Google Scholar 

  3. Booch, G., Rumbaugh, J., Jacobson, I. (1999) Unified Modeling Language User Guide. Addison Wesley Longman

    Google Scholar 

  4. Rational Software Corporation. (2002) Rational Rose, Rational XDE

    Google Scholar 

  5. TogetherSoft Corporation. (2002) Together ControlCenter

    Google Scholar 

  6. Di Battista, G., Didimo, W., Marcandalli, A. (2002) Planarization of clustered graphs. In: P. Mutzel, M. Jünger, and S. Leipert (eds.) Graph Drawing’ 01, Lecture Notes in Computer Science 2265, Springer-Verlag, 60–74

    Google Scholar 

  7. Eades, P., Kelly, D. (1986) Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria 21(A), 89–98

    MathSciNet  Google Scholar 

  8. Eichelberger, H. (2002) SugiBib. In: P. Mutzel, M. Jünger, and S. Leipert (eds.) Graph Drawing’ 01, Lecture Notes in Computer Science 2265, Springer-Verlag, 467–468

    Google Scholar 

  9. Eiglsperger, M., Kaufmann, M. (2001) An approach for mixed upward planarization. In: Proc. 7th International Workshop on Algorithms and Data Structures (WADS’01), Lecture Notes in Computer Science 2125, Springer-Verlag, 352–364

    Google Scholar 

  10. Feng, Q.-W., Cohen, R. F., Eades, P. (1995) Planarity for clustered graphs. In P. Spirakis (ed.) Algorithms — ESA’ 95, Lecture Notes in Computer Science 979, Springer-Verlag, 213–226

    Google Scholar 

  11. Gansner, E. R., Koutsofios, E., North, S. C, Vo, K. P. (1993) A technique for drawing directed graphs. IEEE Transactions on Software Engineering 19(3), 214–230

    Article  Google Scholar 

  12. Garg, A., Tamassia, R. (1995) On the computational complexity of upward and rectilinear planarity testing. In: R. Tamassia and I. G. Tollis (eds.) Graph Drawing’ 94, Lecture Notes in Computer Science 894, Springer-Verlag, 286–297

    Google Scholar 

  13. Gutwenger, C, Mutzel, P., 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

    Google Scholar 

  14. Jünger, M., Leipert, S., Mutzel, P. (1998) A note on computing a maximal planar subgraph using PQ-trees. IEEE Transactions on Computer-Aided Design 17(7), 609–612

    Article  Google Scholar 

  15. Jünger, M., Mutzel, P. (1996) 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications (JGAA) 1(1), 1–25, http://www.cs.brown.edu/publications/jgaa/

    Article  Google Scholar 

  16. Klau, G. W., Klein, K., Mutzel, P. (2000) An experimental comparison of orthogonal compaction algorithms. Technical report, Technische Universität Wien

    Google Scholar 

  17. Klau, G. W., Mutzel, P. (1998) Quasi-orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max-Planck-Institut für Informatik, Saarbrücken

    Google Scholar 

  18. Purchase, H., Allder, J.-A., Carrington, D. (2001) User preference of graph layout aesthetics: A UML study. In: J. Marks (ed.) Graph Drawing’ 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 5–18

    Google Scholar 

  19. Seemann, J. (1997) Extending the sugiyama algorithm for drawing UML class diagrams. In: G. Di Battista (ed.) Graph Drawing’ 97, Lecture Notes in Computer Science 1353, Springer-Verlag, 415–424

    Google Scholar 

  20. Sugiyama, K, Tagawa, S., Toda, M. (1981) Methods for visual understanding of hierarchical systems. IEEE Transactions on System, Man, and Cybernetics SMC-11(2), 109–125

    Article  MathSciNet  Google Scholar 

  21. Tamassia, R. (1988) On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing 16(3), 421–444

    Article  MathSciNet  Google Scholar 

  22. Tamassia, R., Di Battista, G., Batini, C. (1988) Automatic graph drawing and readability of diagrams. IEEE Transactions on System, Man, and Cybernetics SMC-18(1), 61–79

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Center caesar, Ludwig-Erhard-Allee 2, D-53175, Bonn, Germany

    Carsten Gutwenger, Karsten Klein, Joachim Kupke & Sebastian Leipert

  2. Department of Computer Science, University of Cologne, Pohligstraße 1, D-50969, Köln, Germany

    Michael Jünger

  3. Institute of Computer Graphics and Algorithms, Vienna University of Technology, Favoritenstraße 9-11, A-1040, Wien, Austria

    Petra Mutzel

Authors
  1. Carsten Gutwenger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Jünger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Karsten Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Joachim Kupke
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sebastian Leipert
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Petra Mutzel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität zu Köln, Pohligstraße 1, 50969, Köln, Germany

    Michael Jünger

  2. Institut für Computergraphik und Algorithmen, Technische Universität Wien, Favoritenstraße 9-11 E186, 1040, Wien, Austria

    Petra Mutzel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gutwenger, C., Jünger, M., Klein, K., Kupke, J., Leipert, S., Mutzel, P. (2004). A Diagramming Software for UML Class Diagrams. In: Jünger, M., Mutzel, P. (eds) Graph Drawing Software. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18638-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18638-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-62214-4

  • Online ISBN: 978-3-642-18638-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics