Geometric Algorithms (Lecture)

Instructors: Evanthia Papadopoulou

Academic Programs: Master of Science in Informatics

Workload: 6 ECTS

Description

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.

 
Area
Geometric and Visual Computing

Help computers to see the real world and to render virtual worlds. More...

 
Area
Theory and Algorithms

Find out what can and cannot be computed, and how to compute it. More...

 
Gold sponsors:
Silver sponsor:
Con la collaborazione di: