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
Devoirs
Section | Devoirs | Date limite | Travail remis | Note |
---|---|---|---|---|
Übungen und Übungsblätter | Exercise sheet #1: Drawing trees | jeudi 30 avril 2020, 10:15 | ||
Exercise sheet #2: Canonical orders | dimanche 10 mai 2020, 09:00 | |||
Exercise sheet #3: Schnyder realiser | jeudi 14 mai 2020, 10:15 | |||
Exercise sheet #4: Orthogonal drawings | jeudi 28 mai 2020, 11:00 | |||
Exercise sheet #5: Upward planar drawings | jeudi 4 juin 2020, 16:00 | |||
Exercise sheet #6: Hierarchical layouts | jeudi 18 juin 2020, 10:15 | |||
Exercise sheet #7: Contact representations | jeudi 25 juin 2020, 16:15 | |||
Exercise sheet #8: The Crossing Lemma | jeudi 2 juillet 2020, 16:15 | |||
Exercise sheet #9: Force-Directed Methods | jeudi 9 juillet 2020, 16:00 | |||
Exercise sheet #10: Visibility Representation | jeudi 16 juillet 2020, 16:00 |