LEARNING OUTCOMES
You know the most important data structures and algorithms used in geometric processing. You can design and analyze basic geometric algorithms. You have an understanding of computational hardness for geometric problems, and are familiar with several tools used in geometric approximation algorithms.
Credits: 5
Schedule: 09.01.2025 - 03.04.2025
Teacher in charge (valid for whole curriculum period):
Teacher in charge (applies in this implementation): Sándor Kisfaludi-Bak
Contact information for the course (applies in this implementation):
CEFR level (valid for whole curriculum period):
Language of instruction and studies (applies in this implementation):
Teaching language: English. Languages of study attainment: English
CONTENT, ASSESSMENT AND WORKLOAD
Content
valid for whole curriculum period:
The main concepts and tools used in computational geometry: data structures, exact and approximation algorithms, computational hardness. Topics include: arrangements and duality, convex hulls, low-dimensional linear programming, orthogonal range searching, plane sweep, Voronoi diagrams and Delaunay triangulations, quadtrees, spanners, clustering, range spaces.
Workload
valid for whole curriculum period:
Lectures. Teaching in small groups. Independent work.
DETAILS
Study Material
valid for whole curriculum period:
Lecture notes, articles, and chapters from: Computational Geometry: Algorithms and Applications (3rd ed) by Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark Overmars.
Substitutes for Courses
valid for whole curriculum period:
Prerequisites
valid for whole curriculum period:
FURTHER INFORMATION
Further Information
valid for whole curriculum period:
Teaching Language: English
Teaching Period: 2024-2025 Spring III - IV
2025-2026 Spring III - IV