263-4203-00L Geometry: Combinatorics and Algorithms
|Dozierende||B. Gärtner, E. Welzl|
|Periodizität||jährlich wiederkehrende Veranstaltung|
|Lehrveranstaltung||Findet dieses Semester nicht statt.|
|Kurzbeschreibung||This seminar is held once a year and complements the courses Computational Geometry and Geometric Graphs: Combinatorics & Algorithms. Students of the seminar will present original research papers, some classic and some of them very recent. The seminar is a good preparation for a master, diploma, or semester thesis in the area.|
|Lernziel||Each student is expected to read, understand, and elaborate on a selected research paper. To this end, (s)he should give a 45-min. presentation about the paper. The process includes|
* getting an overview of the related literature;
* understanding and working out the background/motivation:
why and where are the questions addressed relevant?
* understanding the contents of the paper in all details;
* selecting parts suitable for the presentation;
* presenting the selected parts in such a way that an audience
with some basic background in geometry and graph theory can easily understand and appreciate it.
|Voraussetzungen / Besonderes||To attend the seminar, some basic knowledge in (discrete and computational) geometry and graphs and algorithms is required. Thus, previous participation in some of the courses "Graphs and Algorithms", "Computational Geometry", "Geometric Graphs: Combinatorics & Algorithms", or similar courses is strongly encouraged. It is also possible to take this seminar in parallel to the lecture "Computational Geometry".|