Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Advertisement

Springer Nature Link
Log in

Approximate Guarding of Monotone and Rectilinear Polygons

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We show that vertex guarding a monotone polygon is NP-hard and construct a constant factor approximation algorithm for interior guarding monotone polygons. Using this algorithm we obtain an approximation algorithm for interior guarding rectilinear polygons that has an approximation factor independent of the number of vertices of the polygon. If the size of the smallest interior guard cover is OPT for a rectilinear polygon, our algorithm produces a guard set of size O(OPT 2).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21
Fig. 22
Fig. 23
Fig. 24

Similar content being viewed by others

References

  1. Aggarwal, A.: The art gallery theorem: its variations, applications and algorithmic aspects. Ph.D. thesis, Johns Hopkins University (1984)

  2. Brodén, B., Hammar, M., Nilsson, B.J.: Guarding lines and 2-link polygons is APX-hard. In: Proc. 13th Canadian Conference on Computational Geometry, CCCG’01, pp. 45–48 (2001)

    Google Scholar 

  3. Cardano, G.: Artis Magnæ, Sive de Regulis Algebraicis Liber Unus (1545). (English translation reprinted by Dover Publications in 1993 as Ars Magna or The Rules of Algebra)

    Google Scholar 

  4. Chazelle, B.: Triangulating a simple polygon in linear time. In: Proc. 31st Symposium on Foundations of Computer Science, pp. 220–230 (1990)

    Chapter  Google Scholar 

  5. Chen, D.Z., Estivill-Castro, V., Urrutia, J.: Optimal guarding of polygons and monotone chains. In: Proc. 7th Canadian Conference on Computational Geometry, CCCG’95, pp. 133–138 (1995)

    Google Scholar 

  6. Chin, W., Ntafos, S.: Optimum Watchman routes. Inf. Process. Lett. 28, 39–44 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chvátal, V.: A combinatorial theorem in plane geometry. J. Comb. Theory, B 13(6), 395–398 (1975)

    Google Scholar 

  8. Clarkson, K.L., Varadarajan, K.: Improved approximation algorithms for geometric set cover. In: Proc. 21st ACM Symposium on Computational Geometry (2005)

    Google Scholar 

  9. Culberson, J.C., Reckhow, R.A.: Covering polygons is hard. In: Proc. 29th Symposium on Foundations of Computer Science, pp. 601–611 (1988)

    Google Scholar 

  10. de Berg, M.: On rectilinear link distance. Comput. Geom., Theory Appl. 1(1), 13–34 (1991)

    Article  MATH  Google Scholar 

  11. Deshpande, A., Kim, T., Demaine, E.D., Sarna, S.E.: A pseudopolynomial time O(logn)-approximation algorithm for art gallery problems. In: Proc. 10th Workshop on Algorithms and Data Structures, WADS’07. Lecture Notes in Computer Science, vol. 4619, pp. 163–174. Springer, Berlin (2007)

    Chapter  Google Scholar 

  12. Efrat, A., Har-Peled, S.: Guarding galleries and terrains. Inf. Process. Lett. 100, 238–245 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Eidenbenz, S.: Inapproximability results for guarding polygons without holes. In: Proc. 9th Annual International Symposium on Algorithms and Computation, pp. 427–436 (1998)

    Chapter  Google Scholar 

  14. Eidenbenz, S.: Inapproximability of visibility problems on polygons and terrains. Ph.D. thesis, ETH, Zurich (2000)

  15. ElGindy, H., Avis, D.: A linear algorithm for computing the visibility polygon from a point. J. Algorithms 2, 186–197 (1981)

    Article  MathSciNet  Google Scholar 

  16. Fejes Tóth, L.: Illumination of convex discs. Acta Math. Acad. Sci. Hung. 29, 355–360 (1977)

    Article  MATH  Google Scholar 

  17. Fisk, S.: A short proof of Chvátal’s Watchman theorem. J. Comb. Theory, B 24, 374 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  18. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  19. Ghosh, S.K.: Approximation algorithms for art gallery problems. In: Proceedings of the Canadian Information Processing Society Congress (1987)

    Google Scholar 

  20. Goodman, J.E., O’Rourke, J. (eds.): Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  21. Hoffmann, F., Kaufmann, M., Kriegel, K.: The art gallery theorem for polygons with holes. In: Proc. 32nd IEEE Symposium on the Foundations of Computer Science, pp. 39–48 (1991)

    Google Scholar 

  22. Joe, B., Simpson, R.B.: Correction to Lee’s visibility polygon algorithm. BIT 27, 458–473 (1987)

    Article  MATH  Google Scholar 

  23. Katz, M.J., Roisman, G.S.: On guarding rectilinear domains. In: Proc. 10th Scandinavian Workshop on Algorithm Theory. Lecture Notes in Computer Science, vol. 4059, pp. 220–231. Springer, Berlin (2006)

    Google Scholar 

  24. King, J., Krohn, E.: Terrain guarding is NP-hard. In: Proc. 21st ACM-SIAM Symposium on Discrete Algorithms, SODA’10, pp. 1580–1593 (2010)

    Google Scholar 

  25. Lee, D.T.: Visibility of a simple polygon. Comput. Vis. Graph. Image Process. 22, 207–221 (1983)

    Article  MATH  Google Scholar 

  26. Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Inf. Theory IT-32, 276–282 (1986)

    Article  MathSciNet  Google Scholar 

  27. Lee, D.T., Preparata, F.P.: An optimal algorithm for finding the kernel of a polygon. J. ACM 26, 415–421 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  28. Levcopoulos, C.: Heuristics for minimum decompositions of polygons. Ph.D. thesis, University of Linköping, Linköping, Sweden (1987)

  29. Levcopoulos, C., Lingas, A.: Covering polygons with minimum number of rectangles. In: Proc. 1st Symposium on the Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 166, pp. 63–72. Springer, Berlin (1984)

    Google Scholar 

  30. Nilsson, B.J.: Guarding art galleries—methods for mobile guards. Ph.D. thesis, Lund University (1995)

  31. O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, London (1987)

    MATH  Google Scholar 

  32. Sack, J.R., Urrutia, J. (eds.): Handbook on Computational Geometry. Elsevier, Amsterdam (1999)

    Google Scholar 

  33. Shermer, T.C.: Recent results in art galleries. Proc. IEEE September, 1384–1399 (1992)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Wisconsin—Oshkosh, Oshkosh, WI, 54901, USA

    Erik A. Krohn

  2. Department of Computer Science, Malmö University, 205 06, Malmö, Sweden

    Bengt J. Nilsson

Authors
  1. Erik A. Krohn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bengt J. Nilsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bengt J. Nilsson.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krohn, E.A., Nilsson, B.J. Approximate Guarding of Monotone and Rectilinear Polygons. Algorithmica 66, 564–594 (2013). https://doi.org/10.1007/s00453-012-9653-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-012-9653-3

Keywords

Search

Navigation