There exist many variants of guarding an orthogonal polygon in an orthogonal fashion: sometimes a guard can see within a rectangle, along a staircase, or along an orthogonal path with at most k bends. In this paper, we study all these guarding models for the special case of orthogonal polygons that have bounded treewidth in some sense. As our main result, we show that the problem of finding the minimum number of guards in all these models becomes linear-time solvable on polygons with bounded treewidth. We complement our main result by giving some hardness results.

中文翻译：

---

关于具有有界树宽的正交保护正交多边形

有许多以正交方式保护正交多边形的变体：有时，守卫可以看到矩形内、沿着楼梯或沿着最多 k 个弯曲的正交路径。在本文中，我们针对在某种意义上具有有界树宽的正交多边形的特殊情况研究了所有这些保护模型。作为我们的主要结果，我们表明在所有这些模型中找到最少数量的守卫的问题在具有有界树宽的多边形上变得线性时间可解。我们通过给出一些硬度结果来补充我们的主要结果。