License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05191.5
URN: urn:nbn:de:0030-drops-3395
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2006/339/
Go to the corresponding Portal |
Eichelberger, Holger
On Class Diagrams, Crossings and Metrics
Abstract
As a standardized software engineering diagram, the UML class diagram provides various information on the static structure of views on software while design, implementation and maintenance phase. This talk gives an overview on drawing UML class diagrams in hierarchical fashion. Therefore, common elements of class diagrams are introduced and aesthetic rules for drawing UML class
diagrams are given. These rules are based on four disciplines involved in the reading process of diagrams. After a brief introduction to our drawing algorithm, an extensive extension of the well-known Sugiyama algorithm, two details are highlighted: A new crossing reduction algorithm is presented and compared to existing ones and issues on measuring the quality of a layout are discussed.
BibTeX - Entry
@InProceedings{eichelberger:DagSemProc.05191.5,
author = {Eichelberger, Holger},
title = {{On Class Diagrams, Crossings and Metrics}},
booktitle = {Graph Drawing},
pages = {1--12},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2006},
volume = {5191},
editor = {Michael J\"{u}nger and Stephen Kobourov and Petra Mutzel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2006/339},
URN = {urn:nbn:de:0030-drops-3395},
doi = {10.4230/DagSemProc.05191.5},
annote = {Keywords: UML class diagrams, semantic aesthetic principles, hierarchical crossing reduction, layout metrics}
}
Keywords: |
|
UML class diagrams, semantic aesthetic principles, hierarchical crossing reduction, layout metrics |
Collection: |
|
05191 - Graph Drawing |
Issue Date: |
|
2006 |
Date of publication: |
|
09.01.2006 |