Exercises for Introduction to Combinatorial and Computational Geometry and Combinatorial and Computational Geometry 2 - 22/23

Česká verze (Czech version)


The lecture in summer term takes place on Friday 9:00 at S11, the exercises on Friday 10:40 at S5.

The exercises for the lecture Combinatorial and Computational Geometry II 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 three weeks to solve the problems and write your solutions. We will give you hints for the most difficult problems after two 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.

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 at least one quarter of all available points to get credit for the course and 70% 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. On the day of a deadline, your solutions should be handed in before the lecture.

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 5.10.2022 26.10.2022 2.11.2022
2. Helly-type theorems and the ham sandwich theorem CZ, EN 19.10.2022 16.11.2022 23.11.2022
3. Crossing numbers and incidences CZ, EN 2.11.2022 7.12.2022
4. Duality and polytopes CZ, EN 23.11.2022 14.12.2022 21.12.2022
5. Polytopes, arrangements, and Voronoi diagrams CZ, EN 7.12.2022 4.1.2023
6. Bonus problems CZ, EN 21.12.2022 2.2.2023


Summer semester

ScoresProblemsAssignedHintsDeadline
1. Erdős–Szekeres theorem pdf 17.2.2023 3.3.2023 10.3.2023
2. k-holes, halving lines and graph drawings pdf 10.3.2023 31.3.2023
3. Davenport–Schinzel sequences pdf 31.3.2023 21.4.2023
4. Intersection patterns of convex sets pdf 21.4.2023 12.5.2023
5. Bonus series - shellability and face numbers of polytopes pdf 19.5.2023 16.7.2023


Schedule (summer semester)

The schedule for presenting the solutions of the homework problems will be
specified later; we plan to present the solutions in the earliest free week
after the deadline.

17.2.2023 Series 1 assigned, exercise
3.3.2023 Hints for Series 1 at the end of the lecture
10.3.2023 Series 2 assigned, exercise, deadline for Series 1
17.3.2023 exercise (substitute for the previous week)
31.3.2023 Series 3 assigned, exercise, deadline for Series 2
21.4.2023 Series 4 assigned, exercise, deadline for Series 3
12.5.2023 Deadline and solutions for Series 4

Schedule (winter semester)

5.10.2022 Series 1 assigned, exercise
19.10.2022 Series 2 assigned, exercise
26.10.2022 Hints for Series 1
2.11.2022 Series 3 assigned, exercise
16.11.2022 Hints for Series 2
23.11.2022 Series 4 assigned, exercise
7.12.2022 Series 5 assigned, exercise
14.12.2022 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

Links

Lecture notes (Bernard Lidický) (in Czech)