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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aggarwal, A.: The Art Gallery Theorem: Its Variations, Applications, and Algorithmic Aspects, Ph.D. Thesis. Johns Hopkins University (1984)
Avis, D., Toussaint, G.T.: An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Trans. Comput. C-30, 910–914 (1981)
Bjorling-Sachs, I., Souvaine, D.L.: A tight bound for edge guards in monotone polygons, DIMACS Technical Report 92-52 (1992)
Chvátal, V.: A combinatorial theorem in plane geometry. J. Combin. Theory, Ser. B 18, 39–41 (1997)
Czyżowicz, J., Kranakis, E., Urrutia, J.: A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments. Inf. Process. Lett. 66, 125–126 (1998)
Finke, U., Hinchirs, K.: Overlaying simply connected planar subdivisions in linear time. In: Proc. of ACM SoCG 1995, pp. 119–126 (1995)
Gewali, L.P., Ntafos, S.: Covering grids and orthogonal polygons with periscope guards. Computational Geometry: Theory and Applications 2, 309–334 (1993)
Hernández-Peñalver, G.: Controlling guards. In: Proc. of CCCG 1994, pp. 387–392 (1994)
Hernández-Peñalver, G.: Vigilancia vigilada en polígonos ortogonales. Actas del VI Encuentro de Geometria Computacional, 198-205 (1995)
Katz, M.J., Mitchell, J.S.B., Nir, Y.: Orthogonal segment stabbing. Computational Geometry: Theory and Applications 30, 197–205 (2005)
Kosowski, A., Małafiejski, M., Żyliński, P.: Weakly cooperative mobile guards in grids. In: Extended abstract in Proc. of JCDCG, pp. 83–84 (2004)
Liaw, B.C., Huang, N.F., Lee, R.C.T.: The minimum cooperative guards problem on k-spiral polygons. In: Proc. of CCCG 1993, pp. 97–101 (1993)
Liaw, B.C., Huang, N.F., Lee, R.C.T.: An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons. Inf. Process. Lett. 52, 69–75 (1994)
Małafiejski, M., Żyliński, P.: Weakly cooperative guards in grids. In: Gervasi, O., Gavrilova, M.L., Kumar, V., Laganá, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol. 3480, pp. 647–656. Springer, Heidelberg (2005)
Michael, T.S., Pinciu, V.: Art gallery theorems for guarded guards. Computational Geometry: Theory and Applications 26, 247–258 (2003)
Michael, T.S., Pinciu, V.: Multiply guarded guards in orthogonal art galleries. In: Alexandrov, V.N., Dongarra, J., Juliano, B.A., Renner, R.S., Tan, C.J.K. (eds.) ICCS-ComputSci 2001. LNCS, vol. 2073, pp. 753–762. Springer, Heidelberg (2001)
Nierhoff, T., Żyliński, P.: Note on cooperative guards in grids. In: Annual CGC Workshop, Neustrelitz (2003)
Ntafos, S.: On gallery watchman in grids. Inf. Process. Lett. 23, 99–102 (1986)
O’Rourke, J.: Galleries need fewer mobile guards: a variation to Chvatátal’s Theorem. Geometriae Dedicata 14, 273–283 (1983)
O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)
Pinciu, V.: ICCSA 2003. LNCS, vol. 2669, pp. 886–893. Springer, Heidelberg (2003)
Urrutia, J.: Art Gallery and Illumination Problems. In: Handbook on Computational Geometry. Elsevier, Amsterdam (2000)
Żyliński, P.: Watched guards in art galleries. accepted for: Journal of Geometry
Żyliński, P.: Cooperative Guards Problem – Combinatorial Bounds and Complexity, Ph.D. Thesis. Gdańsk University (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kosowski, A., Małafiejski, M., Żyliński, P. (2006). An Efficient Algorithm for Mobile Guarded Guards in Simple Grids. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751540_16
Download citation
DOI: https://doi.org/10.1007/11751540_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34070-6
Online ISBN: 978-3-540-34071-3
eBook Packages: Computer ScienceComputer Science (R0)