Mobile vs. point guards

06/08/2017
by   Ervin Győri, et al.
0

We study the problem of guarding orthogonal art galleries with horizontal mobile guards (alternatively, vertical) and point guards, using "rectangular vision". We prove a sharp bound on the minimum number of point guards required to cover the gallery in terms of the minimum number of vertical mobile guards and the minimum number of horizontal mobile guards required to cover the gallery. Furthermore, we show that the latter two numbers can be calculated in linear time.

READ FULL TEXT
research
09/05/2017

Guarding Path Polygons with Orthogonal Visibility

We are interested in the problem of guarding simple orthogonal polygons ...
research
05/17/2023

Convex Cover and Hidden Set in Funnel Polygons

We present linear-time algorithms for both maximum hidden set and minimu...
research
07/27/2022

An optimal generalization of Alon and Füredi's covering result

Given an n-cube 𝒬^n := {0,1}^n in ℝ^n, the k-th layer 𝒬^n_k of 𝒬^n denot...
research
08/19/2023

Securing Pathways with Orthogonal Robots

The protection of pathways holds immense significance across various dom...
research
07/24/2019

An FPT algorithm for orthogonal buttons and scissors

We study the puzzle game Buttons and Scissors in which the goal is to re...
research
09/20/2017

Drawing Graphs on Few Circles and Few Spheres

Given a drawing of a graph, its visual complexity is defined as the numb...
research
03/19/2019

A Choquet Fuzzy Integral Vertical Bagging Classifier for Mobile Telematics Data Analysis

Mobile app development in recent years has resulted in new products and ...

Please sign up or login with your details

Forgot password? Click here to reset