FS 2024 — Dr. R. Královič, Dr. M. Wettstein
Seminar: Algorithms for Geometric Problems
Content
In this seminar, we will give an overview over some of the basic problems and techniques that are relevant to the field of computational geometry. That is, we will study combinatorial algorithms for problems where either the input or the output (or both) consists of geometric objects such as points, line segments, triangles, circles, polygons, triangulations, convex hulls, and more. For the sake of easy visualization, we will mostly consider problems in two (or maybe three) spatial dimensions..
Each participant will study one specific topic from either a scientific publication or a section/chapter of a textbook, and will give a presentation about it. The available topics will be selected in such a way that they are easy to understand and appreciate for anyone who is familiar with the basic ideas and techniques of algorithm design, as taught in the Bachelor's program.
Organization
- The seminar takes place in the room CAB G 56.
- The available topics and any further information regarding the seminar will be published on Moodle.
Dates
| First Meeting | Friday, 23 February | 14‑16 | CAB G 56 | for a short orientation, and distribution of topics |
| Student Talks | Fridays | 14‑16 | CAB G 56 | precise schedule will be published on Moodle |
Literature
- M. de Berg, O. Cheong, M. van Kreveld, M. Overmars: Computational Geometry: Algorithms and Applications, Springer 2008.
- S. L. Devadoss, J. O'Rourke: Discrete and Computational Geometry, Princeton University Press 2011.
Contact: Dr. Manuel Wettstein, ; last change: ; Disclaimer.