Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, March 20, 2007, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Elias Vicari
We will discuss geometric and targets-counting problems for simple robots moving inside a polygon that can only sense the combinatorial features of their surroundings. I will show both algorithmic and impossibility results that illustrate how robots can solve non-trivial problems while not being able to resolve apparently easier tasks. For instance, I will present an algorithm that enables a robot to compute a triangulation of any simple polygon, even though a robot cannot decide in general whether a given vertex is convex or reflex.
Automatic MiSe System Software Version 1.4803M | admin login