Lecture: | Tuesday | 16 -18 | MA 041 |

Thursday | 16 -18 | MA 041 |

Tutorial: | Thursday | 12 -14 | MA 642 |

Thursday | 14 -16 | MA 649 |

This course covers combinatorial, algorithmic and geometric aspects of polytope theory. Participants should have basic knowledge of polytope theory, e.g. from the lecture "Geometric basics of linear optimization". Here is a tentative list of subjects: convex hull algorithms, Voronoi diagrams, Delaunay decompositions, cure reconstruction, regular subdivisions, secondary fans.

- Beck and Robins: Computing the continuous discretely. UTM. Springer, 2007.
- De Loera, Rambau and Santos: Triangulations. Springer, 2010.
- Joswig and Theobald: Polyhedral and algebraic methods in computational geometry. Springer, 2013.
- Matousek: Lectures on discrete geometry. Springer, 2002.
- Schrijver: Theory of linear and integer programming. Wiley, 2000.
- Thomas: Lectures in geometric combinatorics. Student Mathematical Library, 33. IAS/Park City Mathematical Subseries. AMS, Providence, RI; Institute for Advanced Study (IAS), Princeton, NJ, 2006.
- Ziegler: Lectures on polytopes. GTM. Springer, 1995.

This is a direct link to the books in the library of the Department of Mathematics.

- Tutorial 1
- Tutorial 2
- Tutorial 3
- Tutorial 4
- Tutorial 5 ( a bit polymake code )
- Tutorial 6 - update in Exercies T2
- Here is a perl template file for T4
- Tutorial 7
- Tutorial 8 - update in T1
- Tutorial 9 - correction of formula in T2
- Tutorial 10