21 pages, 17 figures, full version of an extended abstract that appeared in the proceedings of the 33rd International Symposium on Algorithms and Computation (ISAAC 2022); revised version
We introduce a new variant of the art gallery problem that comes from safety issues. In this variant we are not interested in guard sets of smallest cardinality, but in guard sets with largest possible distances between these guards. To the best of our knowledge, this variant has not been considered before. We call it the Dispersive Art Gallery Problem. In particular, in the dispersive art gallery problem we are given a polygon $\mathcal{P}$ and a real number $\ell$, and want to decide whether $\mathcal{P}$ has a guard set such that every pair of guards in this set is at least a distance of $\ell$ apart.
In this paper, we study the vertex guard variant of this problem for the class of polyominoes. We consider rectangular visibility and distances as geodesics in the $L_1$-metric. Our results are as follows. We give a (simple) thin polyomino such that every guard set has minimum pairwise distances of at most $3$. On the positive side, we describe an algorithm that computes guard sets for simple polyominoes that match this upper bound, i.e., the algorithm constructs worst-case optimal solutions. We also study the computational complexity of computing guard sets that maximize the smallest distance between all pairs of guards within the guard sets. We prove that deciding whether there exists a guard set realizing a minimum pairwise distance for all pairs of guards of at least $5$ in a given polyomino is NP-complete. We were also able to find an optimal dynamic programming approach that computes a guard set that maximizes the minimum pairwise distance between guards in tree-shaped polyominoes, i.e., computes optimal solutions. Because the shapes constructed in the NP-hardness reduction are thin as well (but have holes), this result completes the case for thin polyominoes.
The Parameterized Complexity of Guarding Almost Convex Polygons
美术馆是计算几何中的一个基本可见性问题。输入包括一个简单的多边形P,(可能是无限的)P内的点集G和C,以及一个整数k;任务是决定是否最多k个守卫可以放置在G中的点上,使得C中的每个点至少对一个守卫可见。在Art Gallery的经典公式中,G和C由P内的所有点组成。其他著名的变体限制G和C由P边界上的所有点或P的所有顶点组成。最近,有三个新的重要发现:上面提到的艺术画廊的变体都是关于k的W[1]-硬的[Bonnet和Miltzow,ESA'16],经典的变体具有O(logk)-近似算法[Bonnet和Miltzow,SoCG'17],并且它可能需要无理保护[Abrahamsen等人,SoCG'17]。在第三个结果的基础上,经典变体和G仅由P的边界上的所有点组成的情况都被证明是\exists R-完全的[Abrahamsen et al.,STOC'18]。即使当G和C都只由P的边界上的所有点组成时,也不知道问题是NP问题。鉴于第一个发现,Giannopoulos [Lorentz Center Workshop,2016]提出了以下问题:艺术画廊的FPT是否与反射顶点的数量r有关?我们专注于变体,其中G和C是P的所有顶点,称为顶点-顶点艺术画廊。我们证明了顶点-顶点艺术画廊在时间r^{O(r^2)}n^{O(1)}上是可解的。我们的方法还扩展到断言顶点边界艺术画廊和边界顶点艺术画廊…
VF-Plan: Bridging the Art Gallery Problem and Static LiDAR Scanning with Visibility Field Optimization
Wuhan University of Technology(武汉理工大学);NED University of Engineering and Technology(奈及利亚工程与技术大学);Zhejiang University(浙江大学);The Advanced Laser Technology Laboratory of Anhui Province(安徽省先进激光技术实验室)