跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21498 · v1

A Polynomial-Time Algorithm for Maximum Witness Set

首次提交 2026-11-17 02:00
版本更新 2026-11-17 02:00
雷达观测 2026-11-17 16:10
arXiv ↗PDF ↗

摘要

A witness set in a polygon is a set of points whose visibility regions are pairwise disjoint. Since no point of the polygon can see more than one witness, the cardinality of a witness set provides a lower bound on the minimum number of guards required to cover the polygon. Finding a maximum witness set is therefore a natural packing counterpart to the classical Art Gallery problem. While the latter is ∃R\exists\mathbb{R}-complete, the computational complexity of finding a maximum witness set in a general simple polygon has remained open. In this paper, we present a polynomial-time algorithm for computing a maximum witness set in a simple polygon with nn vertices, of which ρρ are reflex, assuming that no three vertices are collinear. Our algorithm runs in O(ρ4n6log⁡n)\mathcal{O}(ρ^4n^6\log n) time. Our approach exploits a tree structure induced by witness visibility regions and employs geometric dynamic programming over nested regions determined by visibility windows.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 02:00 · 最新观测版本

A Polynomial-Time Algorithm for Maximum Witness Set

A witness set in a polygon is a set of points whose visibility regions are pairwise disjoint. Since no point of the polygon can see more than one witness, the cardinality of a witness set provides a lower bound on the minimum number of guards required to cover the polygon. Finding a maximum witness set is therefore a natural packing counterpart to the classical Art Gallery problem. While the latter is ∃R\exists\mathbb{R}-complete, the computational complexity of finding a maximum witness set in a general simple polygon has remained open. In this paper, we present a polynomial-time algorithm for computing a maximum witness set in a simple polygon with nn vertices, of which ρρ are reflex, assuming that no three vertices are collinear. Our algorithm runs in O(ρ4n6log⁡n)\mathcal{O}(ρ^4n^6\log n) time. Our approach exploits a tree structure induced by witness visibility regions and employs geometric dynamic programming over nested regions determined by visibility windows.

查看此版本解读 →查看此版本原文 ↗