Exercises for Combinatorial and Computational Geometry I and II - 19/20

Česká verze (Czech version)

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. 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 at least one quarter of all available points to get credit for the course. 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. The deadline for the solutions sent by e-mail is 15:40. We recommend to send the electronic solutions to both TA's.

In case of any questions, you can contact Michal Opler(opler at iuuk.mff.cuni.cz) or Jan Kynčl (kyncl at kam.mff.cuni.cz).

Series of problems Winter semester Scores Problems Assigned Hints Deadline 1. Convex sets CZ, EN 4.10.2019 25.10.2019 1.11.2019 2. Helly-type theorems and the ham sandwich theorem CZ, EN 18.10.2019 8.11.2019 15.11.2019 3. Crossing numbers and incidences CZ, EN 1.11.2019 29.11.2019 4. Duality and polytopes CZ, EN 15.11.2019 13.12.2019 20.12.2019 5. Polytopes, arrangements, and Voronoi diagrams CZ, EN 29.11.2019 10.1.2020 6. Bonus problems CZ, EN 3.1.2020 7.2.2020 Summer semester Scores Problems Assigned Hints Deadline 1. Erdős–Szekeres theorem pdf 25.2.2020 10.3.2020 17.3.2020 2. k-holes, halving lines and graph drawings pdf 17.3.2020 7.4.2020 3. Davenport–Schinzel sequences pdf 7.4.2020 28.4.2020 4. Intersection patterns of convex sets pdf 28.4.2020 19.5.2020 5. Bonus series pdf 19.5.2020 16.7.2020

Schedule (summer semester) 25.2.2020 Series 1 assigned, exercise 10.3.2020 Hints for Series 1 at the end of the lecture 17.3.2020 Series 2 assigned, exercise, deadline for Series 1 7.4.2020 Series 3 assigned, exercise, deadline for Series 2 28.4.2020 Series 4 assigned, exercise, deadline for Series 3 12.5.2020 Hints for Series 4 at the end of the lecture 19.5.2020 deadline for Series 4 Schedule (winter semester) 4.10.2019 Series 1 assigned at the end of the lecture, exercise 18.10.2019 Series 2 assigned, exercise 25.10.2019 Hints for Series 1 at the end of the lecture 1.11.2019 Series 3 assigned, exercise, deadline for Series 1 8.11.2019 Hints for Series 2 at the end of the lecture 15.11.2019 Series 4 assigned, exercise, deadline for Series 2 29.11.2019 Series 5 assigned, exercise, deadline for Series 3 13.12.2019 Hints for Series 4 at the end of the lecture 20.12.2019 exercise, deadline for Series 4 10.1.2020 exercise, deadline for Series 5 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 Links Lecture notes (Bernard Lidický) (in Czech)