|Mittagsseminar Talk Information|
Date and Time: Tuesday, November 08, 2011, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Andreas Bärtschi
Conflict-free art gallery coverage (master's thesis)
We consider a chromatic variant of the art gallery problem, where each guard is assigned one of k distinct colors. A placement of such colored guards is conflict-free if each point of the polygon is seen by some guard whose color appears exactly once among the guards visible to that point. What is the smallest number k(n) of colors that ensure a conflict-free coloring of all n-vertex polygons? We call this the conflict-free chromatic art gallery problem.
Our main result shows that k(n) is O(log n) for orthogonal and for monotone polygons, and O(log^2 n) for arbitrary simple polygons.
Advisors: S. Suri (UCSB), E. Welzl (ETHZ)
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 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.3392 | admin login