Omrit Filtser (Open University) – Robustly Guarding Polygons
Title: Robustly Guarding Polygons Abstract: A fundamental set cover problem that arises in geometric domains is the classic Art Gallery Problem: given a geometric domain (e.g., a polygon), place a set of points within the domain, such that every point in it is seen by at least one of the guards. This problem has many variants […]
