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
Compiti
Argomento | Compiti | Termine consegne | Consegna | Valutazione |
---|---|---|---|---|
Übungen und Übungsblätter | Exercise sheet #1: Drawing trees | giovedì, 30 aprile 2020, 10:15 | ||
Exercise sheet #2: Canonical orders | domenica, 10 maggio 2020, 09:00 | |||
Exercise sheet #3: Schnyder realiser | giovedì, 14 maggio 2020, 10:15 | |||
Exercise sheet #4: Orthogonal drawings | giovedì, 28 maggio 2020, 11:00 | |||
Exercise sheet #5: Upward planar drawings | giovedì, 4 giugno 2020, 16:00 | |||
Exercise sheet #6: Hierarchical layouts | giovedì, 18 giugno 2020, 10:15 | |||
Exercise sheet #7: Contact representations | giovedì, 25 giugno 2020, 16:15 | |||
Exercise sheet #8: The Crossing Lemma | giovedì, 2 luglio 2020, 16:15 | |||
Exercise sheet #9: Force-Directed Methods | giovedì, 9 luglio 2020, 16:00 | |||
Exercise sheet #10: Visibility Representation | giovedì, 16 luglio 2020, 16:00 |