Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, May 18, 2010, 12:15 pm
Duration: This information is not available in the database
Location: CAB G51
Speaker: Emo Welzl
Given a simple polygonal region P and a finite set S of points in P, we want to cover S with the minimum number of disks contained in P. In general, such covering problems tend to be hard, but this one was debunked to be polynomial time solvable by Katz and Morgenstern (2009). We will discuss the structure behind the solution. Be prepared for the appearance of the medial axis and chordal graphs.
Automatic MiSe System Software Version 1.4803M | admin login