论文标题
捕获最低网的多边形鱼
Catching a Polygonal Fish with a Minimum Net
论文作者
论文摘要
鉴于飞机中的多边形$ p $可以在单位正方形内任意翻译，旋转和放大，目标是找到一组线路，以便至少其中一个总是命中$ p $，并且线路数量最小。我们证明该解决方案始终是常规网格或一组等距平行线，其距离取决于$ p $。
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$.
