The course 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. The course covers general algorithmic techniques, such as plane sweep, divide and conquer, incremental construction, randomisation, and approximation, through their application to fundamental geometric problems.
This course is an introduction to computational geometry and its applications. Computational geometry is well related to various application domains, such as pattern recognition, image processing, computer graphics, robotics, geographic information systems (GIS), computer-aided design (CAD), information retrieval, computational science, and others. The students will learn fundamental algorithmic techniques and practice in designing geometric algorithms of their own.
Lectures, exercise labs, homework sets on algorithmic problem solving
The course grade is determined by the results of homework assignments, an optional project, a midterm exam, and a final exam.