Campus Event Calendar
Event Entry
New for: D3
What and Who
Geometry and graph meet at a game!
Jae-Ha Lee
Max-Planck-Institut für Informatik - AG 1
AG1 Mittagsseminar (own work)
AG 1, AG 2, AG 3, AG 4
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Monday, 20 November 2000
13:30
60 Minutes
MPI
024
Saarbrücken
Abstract
I will talk about two topics.
First, I will present my recent results on visibility-based
pursuit-evasion problem defined as follows: Within a given
polygon, plan the path of mobile guards to see the unpredictable
mobile target.
Second, I will advertise one of my(?) problems : online
resource relocation. I will briefly review the previous
results and discuss its generalization.
Contact
Jae Ha Lee
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
computational geomtry, online algorithm, graph theory.