On Some City Guarding Problems

  • Lichen Bao
  • Sergey Bereg
  • Ovidiu Daescu
  • Simeon Ntafos
  • Junqiang Zhou
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5092)


We consider guarding a city of k vertical buildings, each having a rectangular base, by placing guards only at vertices. The aim is to use the smallest number of guards. The problem is a 2.5D variant of the traditional art gallery problem, and finds applications in urban security.

We give upper and lower bounds on the number of guards needed for a few versions of the problem. Specifically, we prove that \(\lfloor\frac{2(k-1)}{3}\rfloor + 1\) guards are always sufficient and sometimes necessary to guard all roofs, and \(1 + k + \lfloor \frac{k}{2}\rfloor\) guards are always sufficient to guard the roofs, walls, and the ground, while each roof has at least one guard on it.


Parent Node Simple Polygon Incoming Edge Generic Trap Blue Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aggarwal, A.: The Art Gallery Theorem: Its Variations, Applications, and Algorithmic Aspects. Ph.D. thesis, Johns Hopkins University, Baltimore (1984)Google Scholar
  2. 2.
    Bao, L., Bereg, S., Daescu, O., Ntafos, S., Zhou, J.: The Complexity Study of City Guard Problem. The University of Texas at Dallas (manuscript, 2007)Google Scholar
  3. 3.
    Chvátal, V.: A Combinatorial Theorem in Plan Geometry. J. Combin. Theory Ser. B 18, 39–41 (1975)CrossRefzbMATHGoogle Scholar
  4. 4.
    Garey, R., Johnson, D.: Computers and Intractability. W.H. Freeman, New York (1979)zbMATHGoogle Scholar
  5. 5.
    Hoffmann, F.: On the Rectilinear Art Gallery Problem. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 717–728. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  6. 6.
    Hoffmann, F., Kriegel, K.: A Graph Coloring Result and Its Consequences for Polygon Guarding Problems. SIAM J. Discrete Mathematics 9(2), 210–224 (1996)CrossRefMathSciNetzbMATHGoogle Scholar
  7. 7.
    Hoffmann, F., Kriegel, K., Tóth, C.D.: Vertex Guards in Reclinear Polygons with Holes. In: Hoffmann, F., Kriegel, K., Tóth, C.D. (eds.) Kyoto International Conference on Computational Geometry and Graph Theory (2007)Google Scholar
  8. 8.
    Kahn, J., Klawe, M., Kleitman, D.: Traditional Galleries Require Fewer Watchmen. SIAM J. Algebraic and Discrete Methods 4, 194–206 (1983)CrossRefMathSciNetzbMATHGoogle Scholar
  9. 9.
    Lee, D., Lin, A.: Computational Complexity of Art Gallery Problems. IEEE Trans. Inform. Theory 32, 276–282 (1986)CrossRefMathSciNetzbMATHGoogle Scholar
  10. 10.
    Lenhart, W., Jennings, G.: An Art Gallery Theorem for Line Segments in the Plane, Williams College (manuscript, 1990)Google Scholar
  11. 11.
    Ntafos, S.: On Gallery Watchman in Grid. Info. Proc. Let. 23, 99–102 (1986)CrossRefzbMATHGoogle Scholar
  12. 12.
    Lozano-Pćrez, T., Wesley, M.: An Algorithm for Planning Collision-Free Paths among Polyhedral Obstacles. Commun. Ass. Comput. Mach. 22, 560–570 (1979)Google Scholar
  13. 13.
    Lubiw, A.: Orderings and Some Combinatorial Optimization Problems with Geometric Applications. Ph.D. thesis, University of Toronto (1985)Google Scholar
  14. 14.
    O’Rourke, J.: Galleries need Fewer Mobile Guards: A Variation on Chvatal’s Theorem. Geometriae Dedicata 14, 273–283 (1983)CrossRefMathSciNetzbMATHGoogle Scholar
  15. 15.
    O’Rourke, J.: An Alternate Proof of the Rectitlinear Art Gallery Theorem. J. of Geometry 21, 118–130 (1983)CrossRefMathSciNetzbMATHGoogle Scholar
  16. 16.
    O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)zbMATHGoogle Scholar
  17. 17.
    O’Rourke, J.: Recovery of Convexity from Visibility Graphs. Tech. Rep. 90.4.6, Dept. Computer Science, Smith College (1990)Google Scholar
  18. 18.
    Shermer, T.: Recent Results in Art Galleries. Tech Report CMPT TR 90-10, Simon Fraser University, Computing Science (1990)Google Scholar
  19. 19.
    Urrutia, J.: Art Gallery and Illumination Problems. In: Sack, J.R., Urrutia, J. (eds.) Handbook on Computational Geometry. Elsevier, Amsterdam (2000)Google Scholar
  20. 20.
    Zylinski, P.: Orthogonal Art Galleries with Holes: a Coloring Proof of Aggarwal’s Theorem. The electronic Journal of Combinatorics 13 (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Lichen Bao
    • 1
  • Sergey Bereg
    • 1
  • Ovidiu Daescu
    • 1
  • Simeon Ntafos
    • 1
  • Junqiang Zhou
    • 1
  1. 1.Department of Computer Science Erik Jonsson School of Engineering & Computer ScienceThe University of Texas at DallasRichardsonUSA

Personalised recommendations