Wednesday, November 4, 2015 - 2:00pm
Art gallery theorems are concerned with the number of guards required to control a polygon, and many variations exist depending on how much power the guards have and what kind of restrictions are imposed on the polygon. Even though by nature these are covering problems, most theorems are based on partitions. With Ervin Győri, we found such a theorem for orthogonal art galleries where guards are allowed to patrol a line segment in the polygon.
In the presentation, some variations of the art gallery problem are visited and part of our proof is described.
You can watch this lecture here: