<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=utf-8">
</head>
<body text="#000000" bgcolor="#FFFFFF">
A T T E N T I O N: Please note that this talk will be given today.<br>
<br>
<br>
<br>
I N V I T A T I O N<br>
<font face="sans-serif"> <br>
<br>
to the Research Seminar 'Computer Graphics, Image Processing, and
Visualization'<br>
<br>
</font><font face="sans-serif"> on Wednesday<font
face="sans-serif">, September 23th, 2015, at 1:15 PM,<br>
in Room P-702 in the Paulinum, Augustusplatz.</font><br>
</font><br>
<br>
The talk is given by<br>
<br>
Ala Abuthawabeh<br>
Image and Signal Processing Group<br>
Institute of Computer Science<br>
Leipzig University<br>
<br>
and is entitled<br>
<br>
"SMNLV: A Small-Multiples Node-Link Visualization Supporting
Software Comprehension by Displaying Multiple Relationships in
Software Structure".<br>
<br>
Abstract:<br>
<br>
Software engineering tasks like understanding of (legacy)
software,<br>
checking guidelines, finding structure, or re-engineering of
existing<br>
software require the analysis of the static software structure.
The optimal<br>
visualization of this structure depends on the task at hand. In
general,<br>
the software structure is mapped to a graph and graph drawing
algorithms<br>
are used for displaying the structure. The task of drawing these
graphs<br>
becomes more involved if not only one type of relations, e.g.,
call graphs,<br>
but many relation types should be analyzed at the same time. We
propose a<br>
small-multiples node-link visualization, where each small
visualization<br>
shows the graph related to one edge type. The visualizations are<br>
synchronized using selection and coordinated views. Using a
separate view<br>
for each of the relations provides additional analysis
capabilities. The<br>
main advantage of this approach is, that optimized drawing
algorithms can<br>
be used for each type of relationship while being able to
display multiple<br>
relationships at the same time.<font face="sans-serif"><br>
<br>
<br>
On behalf of Professor Scheuermann all those interested are
cordially invited to attend.<br>
<br>
<br>
Yours sincerely,</font><br>
<br>
Tom Liebmann
</body>
</html>