Results 1 
8 of
8
A New Approach for Visualizing UML Class Diagrams
"... 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 combina ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
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 nonhierarchical relations poses a special challenge to a graph layout tool. Existing layout tools treat hierarchical and nonhierarchical relations either alike or as separate tasks in a twophase process as in, e.g., [Seemann 1997]. We suggest a new approach for visualizing UML class diagrams leading to a balanced mixture of the following aesthetic criteria: Crossing minimization, bend minimization, uniform direction within each class hierarchy, no nesting of one class hierarchy within another, orthogonal layout, merging of multiple inheritance edges, and good edge labelling. We have realized our approach within the graph drawing library GoVisual. Experiments show the superiority to stateoftheart and industrial standard layouts.
A TopologyShapeMetrics Approach for the Automatic Layout of UML Class Diagrams
"... Class diagrams are among the most popular visualizations for object oriented software systems and have a broad range of applications. In many settings it is desirable that the placement of the diagram elements is determined automatically, especially when the diagrams are generated automatically whic ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Class diagrams are among the most popular visualizations for object oriented software systems and have a broad range of applications. In many settings it is desirable that the placement of the diagram elements is determined automatically, especially when the diagrams are generated automatically which is usually the case in reverse engineering. For this reason the automatic layout of class diagram gained importance in the last years. Current approaches for the automatic layout of class diagrams are based on the hierarchic graph drawing paradigm. These algorithms produce good results for class diagrams with large and deep structural information, i.e., diagrams with a large and deep inheritance hierarchy. However, they do not perform satisfactorily in absence of this information. We propose in this work a new algorithm for automatic layout of class diagram which is based on the topologyshapemetrics approach. The algorithm is an adaption of sophisticated graph drawing algorithms which have proven their effectiveness in many applications. The algorithm works as well for class diagrams with rich structural information as for class diagrams with few or no structural information. It improves therefore the existing algorithms significantly. An implementation of the algorithm is used in the reverse engineering tool JarInspector.
Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size
 IN MUTZEL ET AL
, 2001
"... In this paper, we present a new compaction algorithm which computes orthogonal drawings where the size of the vertices is given as input. This is a critical constraint for many practical applications like UML. The algorithm provides a drastic improvement on previous approaches. It has linear worst c ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
(Show Context)
In this paper, we present a new compaction algorithm which computes orthogonal drawings where the size of the vertices is given as input. This is a critical constraint for many practical applications like UML. The algorithm provides a drastic improvement on previous approaches. It has linear worst case running time and experiments show that it performs very well in practice.
Graph Drawing Algorithm Engineering with AGD
, 2000
"... We discuss the algorithm engineering aspects of AGD, a software library of algorithms for graph drawing. AGD represents algorithms as classes that provide one or more methods for calling the algorithm. There is a common base class, also called the type of an algorithm, for algorithms providing basic ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
We discuss the algorithm engineering aspects of AGD, a software library of algorithms for graph drawing. AGD represents algorithms as classes that provide one or more methods for calling the algorithm. There is a common base class, also called the type of an algorithm, for algorithms providing basically the same functionality. This enables us to exchange components and experiment with various algorithms and implementations of the same type. We give examples for algorithm engineering with AGD for drawing general nonhierarchical graphs and hierarchical graphs.
BendMinimal Orthogonal Drawing of NonPlanar Graphs
, 2004
"... This thesis belongs to the field of graph drawing research. It present s a new procedure for calculatp tl bend minimal shape of nonplanar graphswit givent opology. This met9 d is anextP,,9 oft he SimplePodevsnef drawing stKBRK9 SimplePodevsnef is a simplificatPD of t9 more complex Podevsnef  ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This thesis belongs to the field of graph drawing research. It present s a new procedure for calculatp tl bend minimal shape of nonplanar graphswit givent opology. This met9 d is anextP,,9 oft he SimplePodevsnef drawing stKBRK9 SimplePodevsnef is a simplificatPD of t9 more complex Podevsnef  also known as Kandinsky  st andard. Bot models guarant ee bendminimalit y for planar graphswit givent opology. Theygenerat ortatK9 drawings wit equal vertF size where mult,PD edges can be at hed t a single side of a node. In cont9F t t Kandinsky, SimplePodevsnef has cert, rests9BD,D on t9 split up of such bundles. The algorit9 present9 int hist hesis expandstd drawing st andard for nonplanar graphs. It tKpK crossing point of edges in a special way, and enablestbl t share identen9 grid points where appropriatK Hence it allows crossings of whole bundles of edges inst9 of single edges only. Furt,PB9EKp we show a sharp upper bound of t9 bend count fort he heuristu use of SimplePodevsnef for nonplanar graphs; we also present an ext9F ion oft he new metP d tB is ablet draw nonplanar clustus9,RDB . Clust ergraphs are an ext ension of graphs, wheret here exis t a hierarchical st,pKBp9 of clusters, in whicht he nodes oft he graph are organized.
Crossing minimization and layouts of . . .
"... Many practical applications for drawing graphs are modeled by directed graphs with domain specific constraints. In this paper, we consider the problem of drawing directed hypergraphs with (and without) port constraints, which cover multiple realworld graph drawing applications like data flow diagr ..."
Abstract
 Add to MetaCart
Many practical applications for drawing graphs are modeled by directed graphs with domain specific constraints. In this paper, we consider the problem of drawing directed hypergraphs with (and without) port constraints, which cover multiple realworld graph drawing applications like data flow diagrams and electric schematics. Most existing algorithms for drawing hypergraphs with port constraints are adaptions of the framework originally proposed by Sugiyama et al. in 1981 for simple directed graphs. Recently, a practical approach for upward crossing minimization of directed graphs based on the planarization method was proposed [7]. With respect to the number of arc crossings, it clearly outperforms prior (mostly layeringbased) approaches. We show how to adopt this idea for hypergraphs with given port constraints, obtaining an upwardplanar representation (UPR) of the input hypergraph where crossings are modeled by dummy nodes. Furthermore, we present the new problem of computing an orthogonal upward drawing with minimal number of crossings from such an UPR, and show that it can be solved efficiently by providing a simple method.
Examining the Compactness of Automatically Generated Layouts for Practical Diagrams
"... Abstract. Graph drawing algorithms have important practical applications, e. g. layerbased algorithms for data flow diagram layout in embedded software design and planarizationbased algorithms to layout UML diagrams in software engineering. Most current drawing methods focus on the optimization ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Graph drawing algorithms have important practical applications, e. g. layerbased algorithms for data flow diagram layout in embedded software design and planarizationbased algorithms to layout UML diagrams in software engineering. Most current drawing methods focus on the optimization of aesthetic criteria such as the number of edge crossings and bends. The aspects of compactness and aspect ratio are often treated with lower priority, but in practice these are important as well. We present computational experiments showing that compactness can become a problem, especially for large and nested diagrams. Furthermore, we discuss possible new research directions. 1
Computing Labeled Orthogonal Drawings
, 2003
"... This paper studies the problem of computing labeled orthogonal drawings. A label is modeled as a rectangle of prescribed size and it can be associated with either a vertex or an edge. Several additional optimization goals are taken into account. Namely, the labeled drawing can be required to have ei ..."
Abstract
 Add to MetaCart
(Show Context)
This paper studies the problem of computing labeled orthogonal drawings. A label is modeled as a rectangle of prescribed size and it can be associated with either a vertex or an edge. Several additional optimization goals are taken into account. Namely, the labeled drawing can be required to have either minimum total edge length, or minimum width, or minimum height, or minimum area. We present ILP models to compute optimal drawings with respect to the first three requirements and an algorithm that is based on these models and computes a drawing of minimum area (the compaction problem is known to be NPcomplete in general). We also exhibit different heuristics for computing compact labeled orthogonal drawings and experimentally validate their performance.