Exercises for Introduction to Combinatorial and Computational Geometry - 20/21

Česká verze (Czech version)

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 or hand in a solution by the following Monday. One week after the assignment we will present the solutions of these problems.

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. 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 29.9.2020 20.10.2020 26.10.2020 2. Helly-type theorems and the ham sandwich theorem CZ, EN 13.10.2020 3.11.2020 9.11.2020 3. Crossing numbers and incidences CZ, EN 27.10.2020 23.11.2020 4. Duality and polytopes CZ, EN 10.11.2020 8.12.2020 14.12.2020 5. Polytopes, arrangements, and Voronoi diagrams CZ, EN 24.11.2020 4.1.2021 6. Bonus problems CZ, EN 5.1.2021 18.2.2021

Schedule (winter semester) The schedule for presenting the solutions of the homework problems is still going to be decided. 29.9.2020 Series 1 assigned at the end of the lecture, exercise 6.10.2020 Solutions of the school part of Series 1 13.10.2020 Series 2 assigned, exercise 20.10.2020 Hints for Series 1 at the end of the lecture, solutions of the school part of Series 2 27.10.2020 Series 3 assigned, exercise 3.11.2020 Hints for Series 2 at the end of the lecture, solutions of the school part of Series 3 10.11.2020 Series 4 assigned, exercise 24.11.2020 Series 5 assigned, solutions of the school part of Series 4, exercise 1.12.2020 Solutions of the school part of Series 5 8.12.2020 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 Links Lecture notes (Bernard Lidický) (in Czech)