  Given a polygon $P$ in the plane that can be translated, rotated and enlarged
arbitrarily inside a unit square, the goal is to find a set of lines such that
at least one of them always hits $P$ and the number of lines is minimized. We
prove the solution is always a regular grid or a set of equidistant parallel
lines, whose distance depends on $P$.
