Facets for Art Gallery Problems

  • Sándor P. Fekete
  • Stephan Friedrichs
  • Alexander Kröller
  • Christiane Schmidt
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7936)


We demonstrate how polyhedral methods of mathematical programming can be developed for and applied to computing optimal solutions for large instances of a classical geometric optimization problem with an uncountable number of constraints and variables.

The Art Gallery Problem (AGP) asks for placing a minimum number of stationary guards in a polygonal region P, such that all points in P are guarded. The AGP is NP-hard, even to approximate. Due to the infinite number of points to be guarded as well as possible guard positions, applying mathematical programming methods for computing provably optimal solutions is far from straightforward.

In this paper, we use an iterative primal-dual relaxation approach for solving AGP instances to optimality. At each stage, a pair of LP relaxations for a finite candidate subset of primal covering and dual packing constraints and variables is considered; these correspond to possible guard positions and points that are to be guarded.

Of particular interest are additional cutting planes for eliminating fractional solutions. We identify two classes of facets, based on Edge Cover and Set Cover (SC) inequalities. Solving the separation problem for the latter is NP-complete, but exploiting the underlying geometric structure of the AGP, we show that large subclasses of fractional SC solutions cannot occur for the AGP. This allows us to separate the relevant subset of facets in polynomial time.

Finally, we characterize all facets for finite AGP relaxations with coefficients in {0, 1, 2}. We demonstrate the practical usefulness of our approach with improved solution quality and speed for a wide array of large benchmark instances.


Art Gallery Problem geometric optimization algorithm engineering set cover polytope solving NP-hard problem instances to optimality 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chvátal, V.: A combinatorial theorem in plane geometry. J. Combin. Theory Ser. B 18, 39–41 (1975)zbMATHCrossRefGoogle Scholar
  2. 2.
    Fisk, S.: A short proof of Chvátal’s watchman theorem. Journal of Combinatorial Theory (B 24), 374 (1978)Google Scholar
  3. 3.
    Aigner, M., Ziegler, G.M.: Proofs from the Book, 3rd edn. Springer (2004)Google Scholar
  4. 4.
    O’Rourke, J.: Art Gallery Theorems and Algorithms. International Series of Monographs on Computer Science. Oxford University Press, New York (1987)zbMATHGoogle Scholar
  5. 5.
    Urrutia, J.: Art gallery and illumination problems. In: Sack, J.R., Urrutia, J. (eds.) Handbook on Computational Geometry, pp. 973–1026. Elsevier (2000)Google Scholar
  6. 6.
    Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Inf. Theor. 32(2), 276–282 (1986)MathSciNetzbMATHCrossRefGoogle Scholar
  7. 7.
    Ghosh, S.K.: Approximation algorithms for art gallery problems in polygons and terrains. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 21–34. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  8. 8.
    Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximability results for guarding polygons and terrains. Algorithmica 31(1), 79–113 (2001)MathSciNetzbMATHCrossRefGoogle Scholar
  9. 9.
    Amit, Y., Mitchell, J.S.B., Packer, E.: Locating guards for visibility coverage of polygons. Int. J. Comput. Geometry Appl. 20(5), 601–630 (2010)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Kröller, A., Baumgartner, T., Fekete, S.P., Schmidt, C.: Exact solutions and bounds for general art gallery problems. J. Exp. Alg. (2012)Google Scholar
  11. 11.
    Couto, M.C., de Souza, C.C., de Rezende, P.J.: An exact and efficient algorithm for the orthogonal art gallery problem. In: SIBGRAPI 2007, pp. 87–94. IEEE Computer Society, Washington, DC (2007)Google Scholar
  12. 12.
    Couto, M.C., de Souza, C.C., de Rezende, P.J.: Experimental evaluation of an exact algorithm for the orthogonal art gallery problem. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 101–113. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  13. 13.
    Couto, M.C., de Rezende, P.J., de Souza, C.C.: An exact algorithm for minimizing vertex guards on art galleries. International Transactions in Operational Research 18, 425–448 (2011)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Balas, E., Ng, M.: On the set covering polytope: I. all the facets with coefficients in {0,1,2}. Math. Program. 43(1), 57–69 (1989)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
    Chvátal, V.: A combinatorial theorem in plane geometry. Journal of Combinatorial Theory, Series B 18(1), 39–41 (1975)MathSciNetzbMATHCrossRefGoogle Scholar
  16. 16.
    Schrijver, A.: Combinatorial Optimization - Polyhedra and Efficiency. Springer (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Sándor P. Fekete
    • 1
  • Stephan Friedrichs
    • 1
  • Alexander Kröller
    • 1
  • Christiane Schmidt
    • 1
  1. 1.IBR, Algorithms GroupTU BraunschweigBraunschweigGermany

Personalised recommendations