Reminder: Computational geometry seminar 12-05-2016

Illuminating polygons using edge-aligned vertex floodlights Consider a simple polygon P with n vertices, a set of n floodlights, and an angle alpha such that, on every vertex of P lies the apex of one floodlight, all the floodlights have aperture alpha, and at least one of the bounding rays of each floodlight is aligned with an edge of P. We study the problem of finding the minimum value of alpha required to cover P. This is a joint work with David Orden, Carlos Seara, and Jorge Urrutia.