BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/402
DTSTAMP:20230914T125923Z
SUMMARY:An Art Gallery Approach To Ensure That Landmarks Are Distinguishabl
 e
DESCRIPTION:Speaker: Suneel Sarswat\n\nAbstract: \nIn a 2-dimensional setti
 ng\, how many different classes of partially distinguishable landmarks are
  needed to ensure that a robot can always see a landmark without simultane
 ously seeing two of the same class? In other words\, what is the minimum n
 umber of colors required to color any guard set (not necessarily a minimal
  guard set) of a polygon such that no two guards of the same colors see a 
 common point (conflict-free coloring)? In this talk we will see lower boun
 ds of colors for conflict free guarding of general\, monotone and orthogon
 al  polygons. This is recent work by Lawrence Erickson and Steven LaValle
 .\n
URL:https://www.tcs.tifr.res.in/web/events/402
DTSTART;TZID=Asia/Kolkata:20130906T160000
DTEND;TZID=Asia/Kolkata:20130906T173000
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR