Professor 
Dr. Andreas Kerren, Associate Professor

Time & Place 
Compare here! In general, the lectures will take place
in room D1167, each Wednesday from 15:15 till 17:00. There will be one additional lecture on Tuesday, 20080527, see below.

Teaching Period 
IV (20080402 till 20080604)

Assessment 
Assignments and/or oral or written examinations.

Prerequisites 
DA4094 Information Visualization I, or similar documented experiences.

Credits 
7.5 ECTS

Topic 
Information Visualization in Special Domains
This course extends Information Visualization I with visualization techniques
and systems for special data sets, such as networked data, timedependent data, text, document collections, or software
(socalled software visualization). Furthermore, we discuss the evaluation of visualizations, information visualization
for the masses, as well as applications in bioinformatics, geography, etc.
This course aims at giving an overview of the most important techniques and prerequisites needed to develop effective
visualizations of abstract information. After finishing the course, the students should be able to choose and develop
the most suitable technique for special data sets and applications domains.

Schedule 
Preliminary Schedule:

Materials 
No further materials so far.

Assignments 
Assignments consists of theoretical and practical exercices as well as a short class presentation/demo.
Exercices and Tasks:
 The first exercise consists of a short presentation (about 15 minutes) based on an actual research paper that
is related to the course topics. Presentation date is at Wednesday, 20080514. The lecture at this day will be
shortend.
 The second exercise is an implementation of an algorithm animation. Here, we use the algorithm animation tool
JSAMBA:
Please, read the documentation carafully. The general idea is to print animation statements from your algorithm implementation
into a file. Then, upload the file or copy&paste the content into the JSAMBA tool. Choose one geometric algorithm from the
following list and use a userdefined but nontrivial input:
 Line Intersection: visualize the scanline algorithm for general line segments (not isooriented).
 Convex Hull: visualize the GrahamScan algorithm.
 Priority Search Trees: Visualize the construction of priority search trees and queries on it.
 Voronoi Diagrams: Visualize the construction of a Voronoi diagram based on a point set.
 Delaunay Triangulation: Visualize the construction of a Delaunay Triangulation based on a point set.
A good source for the algorithm is the book Computational Geometry: Algorithms and Applications, de Berg, M., Schwarzkopf, O., van Kreveld, M., and Overmars, M. 2nd Edition, Springer, 2000.
