[论文解读] The Parameterized Complexity of Guarding Almost Convex Polygons

Akanksha Agrawal, Kristine Vitting Klinkby Knudsen+3 more|arXiv (Cornell University)|Jan 1, 2020

Computational Geometry and Mesh Generation被引用 4

一句话总结

本文证明了顶点-顶点博物馆问题（Vertex-Vertex Art Gallery problem），以及顶点-边界（Vertex-Boundary）和边界-顶点（Boundary-Vertex）变体，在以反射顶点数 r 为参数时，均为固定参数可追踪（FPT）。作者提出一种新颖的两阶段约化方法，将其转化为单调二元约束满足问题（Monotone 2-CSP），并利用近乎凸多边形的结构特性，实现时间复杂度为 r^O(r²) · n^O(1) 的算法。

ABSTRACT

The Art Gallery problem is a fundamental visibility problem in Computational Geometry. The input consists of a simple polygon P, (possibly infinite) sets G and C of points within P, and an integer k; the task is to decide if at most k guards can be placed on points in G so that every point in C is visible to at least one guard. In the classic formulation of Art Gallery, G and C consist of all the points within P. Other well-known variants restrict G and C to consist either of all the points on the boundary of P or of all the vertices of P. Recently, three new important discoveries were made: the above mentioned variants of Art Gallery are all W[1]-hard with respect to k [Bonnet and Miltzow, ESA'16], the classic variant has an O(log k)-approximation algorithm [Bonnet and Miltzow, SoCG'17], and it may require irrational guards [Abrahamsen et al., SoCG'17]. Building upon the third result, the classic variant and the case where G consists only of all the points on the boundary of P were both shown to be ∃ℝ-complete [Abrahamsen et al., STOC'18]. Even when both G and C consist only of all the points on the boundary of P, the problem is not known to be in NP. Given the first discovery, the following question was posed by Giannopoulos [Lorentz Center Workshop, 2016]: Is Art Gallery FPT with respect to r, the number of reflex vertices? In light of the developments above, we focus on the variant where G and C consist of all the vertices of P, called Vertex-Vertex Art Gallery. Apart from being a variant of Art Gallery, this case can also be viewed as the classic Dominating Set problem in the visibility graph of a polygon. In this article, we show that the answer to the question by Giannopoulos is positive: Vertex-Vertex Art Gallery is solvable in time r^O(r²)n^O(1). Furthermore, our approach extends to assert that Vertex-Boundary Art Gallery and Boundary-Vertex Art Gallery are both FPT as well. To this end, we utilize structural properties of "almost convex polygons" to present a two-stage reduction from Vertex-Vertex Art Gallery to a new constraint satisfaction problem (whose solution is also provided in this paper) where constraints have arity 2 and involve monotone functions.

研究动机与目标

• 解决Giannopoulos提出的关于以反射顶点数为参数的博物馆问题固定参数可追踪性这一开放问题。
• 将经典点-点博物馆问题的参数化可追踪结果，拓展至顶点-顶点、顶点-边界与边界-顶点变体。
• 为近乎凸多边形开发一种结构化约化技术，使其可通过单调二元约束满足问题（Monotone 2-CSP）实现高效参数化求解。
• 为具有有界反射顶点数的多边形中的基于可视性的守卫问题，提供统一的处理框架。

提出的方法

• 通过边的细分对顶点集合进行精炼，定义‘近乎凸多边形’，构造出在关键可视性位置具有顶点的多边形 P1。
• 使用图灵约化，将顶点-顶点博物馆问题转化为具有受控守卫域与可视域的结构化博物馆问题变体。
• 将该结构化问题约化为单调二元约束满足问题（Monotone 2-CSP），其中约束由可视性与单调性特性定义。
• 利用近乎凸多边形的结构特性，确保顶点与守卫之间的可视关系可编码为单调函数。
• 应用已知的Monotone 2-CSP的FPT算法（定理2），在时间复杂度 r^O(r²) · n^O(1) 内求解约化后的实例。
• 通过引入辅助多边形 P2，将该方法扩展至顶点-边界与边界-顶点博物馆问题，并证明仅将守卫置于顶点即可覆盖整个边界。

实验结果

研究问题

• RQ1 当以反射顶点数为参数时，顶点-顶点博物馆问题是否为固定参数可追踪？
• RQ2 相同的参数化方法是否可推广至顶点-边界与边界-顶点博物馆问题变体？
• RQ3 能否利用近乎凸多边形的结构特性，将可视性问题约化为可追踪的约束满足形式？
• RQ4 在约束编码中使用单调函数，是否能为反射顶点数较少的多边形守卫问题提供高效的FPT算法？

主要发现

• 顶点-顶点博物馆问题在以反射顶点数 r 为参数时为FPT，可在时间复杂度 r^O(r²) · n^O(1) 内求解。
• 顶点-边界与边界-顶点博物馆问题在以 r 为参数时同样为FPT，具有相同的渐近时间复杂度。
• 提出一种新颖的图灵约化方法，将原始守卫问题约化为结构化博物馆问题形式，依赖于辅助多边形 P1 与 P2 的构造。
• 约化过程安全且保持解的等价性，使得可直接应用现有的单调约束FPT算法。
• 近乎凸多边形的结构特性确保：将守卫置于 P1 或 P2 的顶点，即可覆盖所有必要的可视区域。
• 研究结果表明，守卫问题的复杂性本质上与反射顶点数相关，即使在以往未被证明为FPT的变体中亦成立。