|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.