Department of Computer Science | Institute of Theoretical Computer Science | CADMO
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: OAT S15/S16/S17
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.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login