On the complexity of half-guarding monotone polygons
HM Hillberg, E Krohn, A Pahlow - Latin American Symposium on …, 2022 - Springer
We consider a variant of the art gallery problem where all guards are limited to seeing to the
right inside a monotone polygon. We call such guards: half-guards. We provide a polynomial …
right inside a monotone polygon. We call such guards: half-guards. We provide a polynomial …
Opposing Half Guards
We study the art gallery problem for opposing half guards: guards that can either see to their
left or to their right only. We present art gallery theorems, show that the location of half …
left or to their right only. We present art gallery theorems, show that the location of half …
The VC-dimension of limited visibility terrains
M Gibson-Lopez, Z Yang - 32nd International Symposium on …, 2021 - drops.dagstuhl.de
Visibility problems are fundamental to computational geometry, and many versions of
geometric set cover where coverage is based on visibility have been considered. In most …
geometric set cover where coverage is based on visibility have been considered. In most …
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 …
A note on guarding staircase polygons
A Note on Guarding Staircase Polygons Page 1 CCCG 2019, Edmonton, Canada, August 8–10,
2019 A Note on Guarding Staircase Polygons∗ Matt Gibson† Erik Krohn‡ Bengt J. Nilsson§ …
2019 A Note on Guarding Staircase Polygons∗ Matt Gibson† Erik Krohn‡ Bengt J. Nilsson§ …
Computer-Aided Proofs for the VC-Dimension of Art Gallery Variants
Z Yang - 2024 - search.proquest.com
Visibility problems are fundamental to computational geometry, and many versions of
geometric set cover where coverage is based on visibility have been considered. In most …
geometric set cover where coverage is based on visibility have been considered. In most …
[PDF][PDF] Guarding monotone polygons with vertex half-guards is np-hard
Guarding Monotone Polygons with Vertex Half-Guards is NP-Hard Page 1 Guarding Monotone
Polygons with Vertex Half-Guards is NP-Hard ∗ Matt Gibson1, Erik Krohn2, and Matthew …
Polygons with Vertex Half-Guards is NP-Hard ∗ Matt Gibson1, Erik Krohn2, and Matthew …