Kursinformationen
Kursbeschreibung
This course discusses the most important algorithms for graph drawing. Many methods are imported from the Algorithmic Graph Theory lecture; such as: divide and conquer, network flows, integer programming and the planar separator theorem. We will discuss measures of the quality of graph drawings and algorithms to optimize them.
|
SS20: Visualisierung von Graphen
Assignments
Topic | Assignments | Due date | Submission | Grade |
---|---|---|---|---|
Übungen und Übungsblätter | Exercise sheet #1: Drawing trees | Thursday, 30 April 2020, 10:15 AM | ||
Exercise sheet #2: Canonical orders | Sunday, 10 May 2020, 9:00 AM | |||
Exercise sheet #3: Schnyder realiser | Thursday, 14 May 2020, 10:15 AM | |||
Exercise sheet #4: Orthogonal drawings | Thursday, 28 May 2020, 11:00 AM | |||
Exercise sheet #5: Upward planar drawings | Thursday, 4 June 2020, 4:00 PM | |||
Exercise sheet #6: Hierarchical layouts | Thursday, 18 June 2020, 10:15 AM | |||
Exercise sheet #7: Contact representations | Thursday, 25 June 2020, 4:15 PM | |||
Exercise sheet #8: The Crossing Lemma | Thursday, 2 July 2020, 4:15 PM | |||
Exercise sheet #9: Force-Directed Methods | Thursday, 9 July 2020, 4:00 PM | |||
Exercise sheet #10: Visibility Representation | Thursday, 16 July 2020, 4:00 PM |