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: 11.01.2023 - 14.04.2023
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, and VC dimension.
Assessment Methods and Criteria
valid for whole curriculum period:
Points earned from weekly problem sets determine the course grade.
Workload
valid for whole curriculum period:
Lectures. Teaching in small groups. Independent work.
DETAILS
Substitutes for Courses
valid for whole curriculum period:
Prerequisites
valid for whole curriculum period:
FURTHER INFORMATION
Further Information
valid for whole curriculum period:
Workload over 12 weeks: each week consists of lecture (2h), Q&A session reviewing the weekly problem set (2h), as well as independent work (7h) in solving the weekly problem set. Total 135h.
Teaching Language : English
Teaching Period : 2022-2023 Spring III - IV
2023-2024 Spring III - IV