Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, December 16, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Kaspar Fischer
Some problems from computational geometry can be solved in subexponential time (in the real RAM model of computation). Examples include linear programming and the computation of the smallest enclosing ball (a.k.a. "miniball") of a pointset in Rd, which both can be solved in expected time O(poly(d) n eo(d)).
In this talk, I am going to explain how one can obtain subexpontential algorithms for two additional problems (distance between the convex hulls of two sets of balls, and the miniball of balls).
For this, we generalize Bernd Gärtner & Sven Schöherr's method for solving quadratic programs, and use Gärtner's subexponential algorithm for so-called "abstract optimization problems."
Automatic MiSe System Software Version 1.4803M | admin login