We solve the $r$-star covering problem in simple orthogonal polygons, also known as the point guard problem in simple orthogonal polygons with rectangular vision, in quadratic time.

翻译：我们解决了简单正交多边形中的$r$-星覆盖问题，也称为具有矩形视野的简单正交多边形中的点守卫问题，并在二次时间内完成求解。