AI Chat AI Image Generator AI Video Text to Speech

Opposing Half Guards

07/10/2022

∙

by Erik Krohn, et al.

∙

∙

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 guards in 2-guardable polygons is not restricted to extensions, show that the problem is NP-hard in monotone polygons, and present approximation algorithms for spiral and staircase polygons.

Erik Krohn
4 publications
Bengt J. Nilsson
7 publications
Christiane Schmidt
7 publications

page 1

page 2

page 3

page 4

research

∙ 04/27/2022

On the Complexity of Half-Guarding Monotone Polygons

We consider a variant of the art gallery problem where all guards are li...

0 Hannah Miller Hillberg, et al. ∙

research

∙ 06/07/2020

The Continuous Joint Replenishment Problem is Strongly NP-Hard

The Continuous Periodic Joint Replenishment Problem (CPJRP) has been one...

0 Alexander Tuisov, et al. ∙

research

∙ 12/15/2017

Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards

The art gallery problem enquires about the least number of guards suffic...

0 Pritam Bhattacharya, et al. ∙

research

∙ 02/18/2020

Probabilistically Faulty Searching on a Half-Line

We study p-Faulty Search, a variant of the classic cow-path optimization...

0 Anthony Bonato, et al. ∙

research

∙ 10/25/2018

Inverse Problems in Topological Persistence

In this survey, we review the literature on inverse problems in topologi...

0 Steve Oudot, et al. ∙

research

∙ 04/11/2022

On complex roots of the independence polynomial

It is known from the work of Shearer (1985) (and also Scott and Sokal (2...

0 Ferenc Bencs, et al. ∙

research

∙ 11/24/2021

Explicit solution of divide-and-conquer dividing by a half recurrences with polynomial independent term

Divide-and-conquer dividing by a half recurrences, of the form x_n =a· x...

0 Tomás M. Coronado, et al. ∙