Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, November 16, 2021, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Daniel Bertschinger
A family of k point sets in d dimensions is called well-separated if the convex hulls of any two disjoint subfamilies can be separated by a hyperplane. This notion is instrumental in showing that certain kinds of generalized ham-sandwich cuts exist. But how hard is it to check whether a given family of high-dimensional point sets has this property? Starting from this question, we will study several algorithmic aspects of the existence of high-dimensional transversals and separations. This is joint work with H. Bergold, N. Grelier, W. Mulzer, and P. Schnider.
Automatic MiSe System Software Version 1.4803M | admin login