Exercises for Introduction to Combinatorial and Computational Geometry - 23/24

Česká verze (Czech version)


The lecture takes place on Wednesday 12:20 at S9, the exercises on Wednesday 14:00 at S8.

The exercises for the lecture Introduction to Combinatorial and Computational Geometry take place irregularly according to the preliminary schedule shown below. You will get the credit if you solve enough problems assigned during the semester. Each problem is evaluated according to its difficulty. Usually you will have four weeks to solve the problems and write your solutions. We will give you hints for the most difficult problems after three weeks. After we give you a hint for a problem, the amount of points that you can get for solving this problem reduces to half of the original maximum. If you hand in a better solution after the hint has been given, we add half of the points from your previous solution to the points from your new solution. It is not possible to get any points for solving the problems after a deadline has passed. Near the end of the semester, it is possible to assign a series of bonus problems to allow interested students earn the missing points.

During the exercise sessions, we will assign some easy problems to practice new definitions and notions from the lecture. Each of these problems is worth one point, which you get if you present us a correct solution by the end of the exercise session

You need 30 points to get credit for the course and 65 for automatically passing the exam. Generally, the more points you get, the easier the exam will be for you. If you wish to see your score on this page, please choose a nickname and write it on the paper with your solutions (as well as your name), or send it by e-mail. Without the nickname we will not make your score public.

You can also submit the solutions online in Moodle.

In case of any questions, you can contact Jan Soukup (soukup at kam.mff.cuni.cz) or Jan Kynčl (kyncl at kam.mff.cuni.cz).



Series of problems

Winter semester

ScoresProblemsAssignedHintsDeadline
1. Convex sets CZ, EN 4.10.2023 25.10.2023 1.11.2023
2. Helly-type theorems and the ham sandwich theorem CZ, EN 18.10.2023 8.11.2023 22.11.2023
3. Crossing numbers and incidences CZ, EN 1.11.2023 6.12.2023
4. Duality and polytopes CZ, EN 22.11.2023 13.12.2023 20.12.2023
5. Polytopes, arrangements, and Voronoi diagrams CZ, EN 6.12.2023 10.1.2024
6. Bonus problems CZ, EN 11.1.2024 8.2.2024

Schedule (winter semester)

The schedule for presenting the solutions of the homework problems will be
specified later; we plan to present the solutions either in the earliest free week
after the deadline, or at the day of the deadline (series 5).

4.10.2023 Series 1 assigned, exercise
18.10.2023 Series 2 assigned, exercise
25.10.2023 Hints for Series 1
1.11.2023 Series 3 assigned, exercise
8.11.2023 Hints for Series 2
22.11.2023 Series 4 assigned, exercise
6.12.2023 Series 5 assigned, exercise
13.12.2023 Hints for Series 4

Archive

2003/2004
2004/2005
2005/2006
2006/2007
2007/2008
2008/2009
2009/2010
2010/2011
2011/2012
2012/2013
2013/2014
2014/2015
2015/2016
2016/2017
2017/2018
2018/2019
2019/2020
2020/2021
2021/2022
2022/2023

Links