The VC-dimension of visibility on the boundary of a simple polygon
In this paper, we prove that the VC-Dimension of visibility on the boundary of a simple
polygon is exactly 6. Our result is the first tight bound for any variant of the VC-Dimension …
polygon is exactly 6. Our result is the first tight bound for any variant of the VC-Dimension …
On Half Guarding Polygons
Given a polygon P and a set of potential guard locations G∈ P, the art gallery problem asks
for the minimum number of guards needed to guard the polygon. The art gallery problem …
for the minimum number of guards needed to guard the polygon. The art gallery problem …
Exact VC-dimension for -visibility of points in simple polygons
E Langetepe, S Lehmann - arXiv preprint arXiv:1705.01723, 2017 - arxiv.org
The VC-dimension plays an important role for the algorithmic problem of guarding art
galleries efficiently. We prove that inside a simple polygon at most $5 $ points can be …
galleries efficiently. We prove that inside a simple polygon at most $5 $ points can be …
Minimum Polygons for Fixed Visibility VC-Dimension
M Beck, S Storandt - International Workshop on Combinatorial Algorithms, 2018 - Springer
Motivated by the art gallery problem, the visibility VC-dimension was investigated as a
measure for the complexity of polygons in previous work. It was shown that simple polygons …
measure for the complexity of polygons in previous work. It was shown that simple polygons …
[图书][B] Understanding of geometric visibility in polygons
Q Wang - 2016 - search.proquest.com
Geometric covering problems have been a focus of research for decades. Most variants of
the problem are NP-hard, and therefore most research on geometric set cover focuses on …
the problem are NP-hard, and therefore most research on geometric set cover focuses on …