19 citations · 46 across the 18 of their papers we have counts for
Showing 2012 · cs.CGShow all
2 papers · 2 filters
cs.CG2012★ 1 cited
Inapproximability of the Smallest Superpolyomino Problem
Andrew Winslow
We consider the \emph{smallest superpolyomino problem}: given a set of colored polyominoes, find the smallest polyomino containing each input polyomino as a subshape. This problem…
cs.CG2012★ 2 cited
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…