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
Aufgaben
Abschnitt | Aufgaben | Fälligkeitsdatum | Abgabe | Bewertung |
---|---|---|---|---|
Übungen und Übungsblätter | Exercise sheet #1: Drawing trees | Donnerstag, 30. April 2020, 10:15 | ||
Exercise sheet #2: Canonical orders | Sonntag, 10. Mai 2020, 09:00 | |||
Exercise sheet #3: Schnyder realiser | Donnerstag, 14. Mai 2020, 10:15 | |||
Exercise sheet #4: Orthogonal drawings | Donnerstag, 28. Mai 2020, 11:00 | |||
Exercise sheet #5: Upward planar drawings | Donnerstag, 4. Juni 2020, 16:00 | |||
Exercise sheet #6: Hierarchical layouts | Donnerstag, 18. Juni 2020, 10:15 | |||
Exercise sheet #7: Contact representations | Donnerstag, 25. Juni 2020, 16:15 | |||
Exercise sheet #8: The Crossing Lemma | Donnerstag, 2. Juli 2020, 16:15 | |||
Exercise sheet #9: Force-Directed Methods | Donnerstag, 9. Juli 2020, 16:00 | |||
Exercise sheet #10: Visibility Representation | Donnerstag, 16. Juli 2020, 16:00 |