Discrete & Computational Geometry

, Volume 13, Issue 1, pp 77–109 | Cite as

An efficient algorithm for guard placement in polygons with holes

  • I. Bjorling-Sachs
  • D. L. Souvaine
Article

Abstract

In this paper we consider the problem of placing guards to supervise an art gallery with holes. No gallery withn vertices andh holes requires more than [(n+h)/3] guards. For some galleries this number of guards is necessary. We present an algorithm which places the [(n+h)/3] guards inO(n2) time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Avis and G. T. Toussaint, An efficient algorithm for decomposing a polygon into star-shaped pieces,Pattern Recognition 13 (1981), 395–398.MathSciNetCrossRefGoogle Scholar
  2. 2.
    I. Bjorling-Sachs and D. Souvaine, A Tight Bound for Guarding Polygons with Holes, Rutgers University Technical Report LCSR-TR-165, May 1991. Abstract appears inFinal Report of MSI Stony Brook Workshop on Computational Geometry, Stony Brook, Oct. 1991, p. 17.Google Scholar
  3. 3.
    V. Chvátal, A combinatorial theorem in plane geometry,Journal of Combinatorial Theory, Series B 18 (1975), 39–41.MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    S. Fisk, A short proof of Chvátal's watchman theorem,Journal of Combinatorial Theory, Series B 24 (1978), 374.MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    F. Hoffmann, Colloquium, Department of Computer Science, Rutgers University, 24. Oct. 1991.Google Scholar
  6. 6.
    F. Hoffmann, M. Kaufmann, and K. Kriegel, The art gallery theorem for polygons with holes,Proceedings of the Symposium of Foundations of Computer Science, 1991, pp. 39–48.Google Scholar
  7. 7.
    R. Honsberger,Mathematical Gems II, Mathematical Association of America, Washington, DC, 1976, pp. 104–110.Google Scholar
  8. 8.
    J. O'Rourke,Art Gallery Problems and Algorithms, Oxford University Press, Oxford, 1987.MATHGoogle Scholar
  9. 9.
    G. T. Toussaint, An optimal algorithm for computing the relative convex hull of a set of points in a polygon,Signal Processing III: Theories and Applications (Proceedings of the Third European Signal Processing Conference) (1986), pp. 853–856.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1995

Authors and Affiliations

  • I. Bjorling-Sachs
    • 1
  • D. L. Souvaine
    • 2
  1. 1.Department of Computer ScienceLafayette CollegeEastonUSA
  2. 2.Department of Computer ScienceRutgers UniversityNew BrunswickUSA

Personalised recommendations