55 citations · 134 across the 13 of their papers we have counts for
4 papers · 1 filter
Combinatorics and complexity of guarding polygons with edge and point 2-transmitters
Sarah Cannon, Thomas G. Fai, Justin Iwerks +2
We consider a generalization of the classical Art Gallery Problem, where instead of a light source, the guards, called -transmitters, model a wireless device with a signal that…
Diffuse Reflection Diameter in Simple Polygons
Gill Barequet, Sarah M. Cannon, Eli Fox-Epstein +4
We prove a conjecture of Aanjaneya, Bishnu, and Pal that the minimum number of diffuse reflections sufficient to illuminate the interior of any simple polygon with walls from a…
Hidden Mobile Guards in Simple Polygons
Sarah Cannon, Diane L. Souvaine, Andrew Winslow
We consider guarding classes of simple polygons using mobile guards (polygon edges and diagonals) under the constraint that no two guards may see each other. In contrast to most ot…
Conflict-free graph orientations with parity constraints
Sarah Cannon, Mashhood Ishaque, Csaba Tóth
It is known that every multigraph with an even number of edges has an even orientation (i.e., all indegrees are even). We study parity constrained graph orientations under addition…