Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Date and Time: Tuesday, May 18, 2010, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: Emo Welzl

Covering Points By Disks Inside a Simple Polygon

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   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