An efficient algorithm for mobile guarded guards in simple grids

Authors:
Adrian Kosowski;Michał Małafiejski;Paweł Żyliński
Affiliations:
Department of Algorithms and System Modeling, Gdańsk University of Technology;Department of Algorithms and System Modeling, Gdańsk University of Technology;Insitute of Mathematics, University of Gdańsk
Venue:
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
Year:
2006

Citing 13
Cited 1

On gallery watchmen in grids

Information Processing Letters
Art gallery theorems and algorithms

Art gallery theorems and algorithms
Covering grids and orthogonal polygons with periscope guards

Computational Geometry: Theory and Applications
An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons

Information Processing Letters
Overlaying simply connected planar subdivisions in linear time

Proceedings of the eleventh annual symposium on Computational geometry
A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments

Information Processing Letters
Multiply Guarded Guards in Orthogonal Art Galleries

ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
The art gallery theorem: its variations, applications and algorithmic aspects

The art gallery theorem: its variations, applications and algorithmic aspects
Art gallery theorems for guarded guards

Computational Geometry: Theory and Applications
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge

IEEE Transactions on Computers
Orthogonal segment stabbing

Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
Connected guards in orthogonal art galleries

ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Weakly cooperative guards in grids

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I

Cooperative mobile guards in grids

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

A set of mobile guards in a grid is guarded if at any point on its patrol segment every guard can be seen by at least one other guard. Herein we discuss a class of polygon-bounded grids and simple grids for which we propose a quadratic time algorithm for solving the problem of finding the minimum set of mobile guarded guards (the MinMGG problem). Recall that the MinMGG problem is NP-hard even for grids every segment of which crosses at most three other segments. We also provide an O(n log n) time algorithm for the MinMGG problem in horizontally or vertically unobstructed grids. Finally, we investigate complete rectangular grids with obstacles. We show that if both the vertical and the horizontal sizes of the grid are larger than the number of obstacles k, k+2 mobile guarded guards always suffice to cover the grid.