10:30 am - 12:30 pm
Room: Section A
For Part II, See MS10.
Combinatorial geometry deals with questions of enumeration and existence of geometric objects, like triangulations, sets of line segments, polytopes, packings, coverings etc. These subjects have always been the subject of investigations of classical combinatorialists. In recent decades, results from combinatorial geometry have found the bases for the design and analysis of algorithms in computational geometry. The relevance of combinatorial geometry extends to other branches of mathematics like graph theory (e.g. graph drawing), operations research (e.g. packing and covering problems). This minisymposium will highlight some of the recent achievments in combinatorial geometry.
Organizers: Pavel Valtr