Darstellung / Vorschau
(M169) - Βησσαρίων Φυσικόπουλος
Beschreibung des Kurses
Graduate course, Spring 2026, Friday 11 am - 3 pm, room Δ (Department of Informatics and Telecommunications)
Intoduction to geometric algorithms and computation. Overview of active research areas of computational geometry. Design and analysis of algorithms, geometric software implementations and real-world applications (such as computational finance and structural biology).
Topics:
- Convexity, convex hulls, volume computation.
- Robust geometric computations, input degeneracy, predicates, filters.
- Voronoi diagram, Delaunay triangulation, alpha-shapes.
- Linear programming algorithms and reverse search, duality.
- Minkowski sum, triangulations and regular subdivisions; connections to algebraic geometry and optimization.
- Randomized geometric algorithms; high-dimensional sampling and volume approximation.
- Geometric data structures, approximate nearest neighbors, spatial databases.
Creation Date
Dienstag, 18. Februar 2025
-
Syllabus
Grading
A. Take home assignment, up to 1/3
B. Class participation 5%
C. Course project (oral presenations & final report), the rest.
Class presentations should use PDF / ΡΡΤ files to discuss and critically present their topic. At the end of the exam period students submit a full report discussing / comparing their papers, possibly open questions and future work. Also any experiments and software they developed.Course Syllabus
20 February: Introduction and course details