Guarding thin orthogonal polygons is hard
AP Tomás - … Symposium on Fundamentals of Computation Theory, 2013 - Springer
An orthogonal polygon of P is called “thin” if the dual graph of the partition obtained by
extending all edges of P towards its interior until they hit the boundary is a tree. We show …
extending all edges of P towards its interior until they hit the boundary is a tree. We show …
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 …
[PDF][PDF] Guarding Monotone Polygons with Half-Guards.
We consider a variant of the art gallery problem where all guards are limited to seeing to the
right inside of a monotone polygon. We provide a polynomial-time 4-approximation …
right inside of a monotone polygon. We provide a polynomial-time 4-approximation …
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 …
[PDF][PDF] On the VC-Dimension of Visibility in Monotone Polygons.
On the VC-Dimension of Visibility in Monotone Polygons Page 1 CCCG 2014, Halifax, Nova
Scotia, August 11–13, 2014 On the VC-Dimension of Visibility in Monotone Polygons Matt …
Scotia, August 11–13, 2014 On the VC-Dimension of Visibility in Monotone Polygons Matt …
APX-Hardness of the Minimum Vision Points Problem
M Chaturvedi, BJ Nilsson - arXiv preprint arXiv:2207.04488, 2022 - arxiv.org
Placing a minimum number of guards on a given watchman route in a polygonal domain is
called the {\em minimum vision points problem}. We prove that finding the minimum number …
called the {\em minimum vision points problem}. We prove that finding the minimum number …
[HTML][HTML] Altitude terrain guarding and guarding uni-monotone polygons
O Daescu, S Friedrichs, H Malik, V Polishchuk… - Computational …, 2019 - Elsevier
We present an optimal, linear-time algorithm for the following version of terrain guarding:
given a 1.5 D terrain and a horizontal line, place the minimum number of guards on the line …
given a 1.5 D terrain and a horizontal line, place the minimum number of guards on the line …
On Vertex Guarding Staircase Polygons
M Gibson-Lopez, E Krohn, BJ Nilsson… - Latin American …, 2022 - Springer
In this paper, we consider the variant of the art gallery problem where the input polygon is a
staircase polygon. Previous works on this problem gave a 2-approximation for point …
staircase polygon. Previous works on this problem gave a 2-approximation for point …
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§ …