Search for contacts, projects,
courses and publications

Geometric Algorithms


This course is an introduction to computational geometry and its applications. It covers techniques needed in designing and analyzing efficient algorithms for computational problems in discrete geometry such as convex hulls, triangulations, geometric intersections, Voronoi diagrams, Delaunay triangulations, arrangements of lines and hyperplanes, and range searching. Computational geometry is well related to diverse application domains, where geometric algorithms play a fundamental role, such as pattern recognition, image processing, computer graphics, robotics, geographic information systems (GIS), computer-aided design (CAD), information retrieval, computational science, and many others. The course covers general algorithmic techniques, such as plane sweep, divide and conquer, incremental construction, randomization, and approximation, through their application to basic geometric problems.




  • Computational Geometry, Algorithms and Applications; M. de Berg, O. Cheong, M. van Kreveld, M. Overmars; Springer-Verlag, 3rd ed., 2008
  • Computational Geometry lecture notes; David Mount;
  • Optional: Computational Geometry in CJ. O’ Rourke, 2nd ed., Cambridge, University Press



Papadopoulou E.

Course director

Junginger K.


Additional information

Academic year
Master of Science in Artificial Intelligence, Elective course, Lecture, 1st and 2nd year

Master of Science in Computational Science, Elective course, Lecture, 1st and 2nd year

Master of Science in Informatics, Elective course, Lecture, 1st and 2nd year

PhD programme of the Faculty of Informatics, Elective course, Lecture, 1st, 2nd and 3rd year