Skip to main content
SpringerLink
Log in

Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region

  • Conference paper
Frontiers in Algorithmics and Algorithmic Aspects in Information and Management

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7285))

  • 763 Accesses

Abstract

The two-guard problem asks whether two guards can walk to detect an unpredictable, moving target in a polygonal region P, no matter how fast the target moves, and if so, construct a walk schedule of the guards. For safety, two guards are required to always be mutually visible, and thus, they move on the polygon boundary. Specially, a straight walk requires both guards to monotonically move on the boundary of P from beginning to end, one clockwise and the other counterclockwise.

The objective of this paper is to find an optimum straight walk such that the maximum distance between the two guards is minimized. We present an O(n 2 logn) time algorithm for optimizing this metric, where n is the number of vertices of the polygon P. Our result is obtained by investigating a number of new properties of the min-max walks and converting the problem of finding an optimum walk in the min-max metric into that of finding a shortest path between two nodes in a graph. This answers an open question posed by Icking and Klein.

Work by Tan was partially supported by Grant-in-Aid (23500024) for Scientific Research from Japan Society for the Promotion of Science, and work by Jiang was partially supported by National Natural Science Foundation of China under grant 61173034.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. Int. J. Comput. Geom. & Appl. 5, 75–91 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bespamyatnikn, B.: An optimal morphing between polylines. Int. J. Comput. Geom. & Appl. 12, 217–228 (2002)

    Article  Google Scholar 

  3. Bhattacharya, B.K., Mukhopadhyay, A., Narasimhan, G.: Optimal Algorithms for Two-Guard Walkability of Simple Polygons. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 438–449. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Chazelle, B., Guibas, L.: Visibility and intersection problem in plane geometry. Discrete Comput. Geom. 4, 551–581 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cook, A.F., Wenk, C.: Geodesic Fréchet distance inside a simple polygon. ACM Trans. Algo. 7(1) (2010)

    Google Scholar 

  6. Corman, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introdution to algorithms, 2nd edn. The MIT Press (2001)

    Google Scholar 

  7. Efrat, A., Guibas, L.J., Har-Peled, S., Lin, D.C., Mitchell, J.S.B., Murali, T.M.: Sweeping simple polygons with a chain of guards. In: Proc., ACM-SIAM Sympos. Discrete Algorithms, pp. 927–936 (2000)

    Google Scholar 

  8. Ghosh, S.K.: Visibility algorithms in the plane. Cambridge University Press (2007)

    Google Scholar 

  9. Guibas, L.J., Latombe, J.C., Lavalle, S.M., Lin, D., Motwani, R.: Visibility-based pursuit-evasion in a polygonal environment. IJCGA 9, 471–493 (1999)

    MathSciNet  Google Scholar 

  10. Heffernan, P.J.: An optimal algorithm for the two-guard problem. Int. J. Comput. Geom. & Appl. 6, 15–44 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  11. Icking, C., Klein, R.: The two guards problem. Int. J. Comput. Geom. & Appl. 2, 257–285 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  12. LaValle, S.M., Simov, B., Slutzki, G.: An algorithm for searching a polygonal region with a flashlight. Int. J. Comput. Geom. & Appl. 12, 87–113 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lee, J.H., Park, S.M., Chwa, K.Y.: Searching a polygonal room with one door by a 1-searcher. Int. J. Comput. Geom. & Appl. 10, 201–220 (2000)

    MathSciNet  MATH  Google Scholar 

  14. Suzuki, I., Yamashita, M.: Searching for mobile intruders in a polygonal region. SIAM J. Comp. 21, 863–888 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  15. Tan, X.: A unified and efficient solution to the room search problem. Comput. Geom. Theory Appl. 40(1), 45–60 (2008)

    Article  MATH  Google Scholar 

  16. Tan, X.: An efficient algorithm for the three-guard problem. Discrete Appl. Math. 158, 3312–3324 (2008)

    Article  Google Scholar 

  17. Tan, X.: Sweeping simple polygons with the minimum number of chain guards. Inform. Process. Lett. 102, 66–71 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. Tan, X.: The Two-Guard Problem Revisited and Its Generalization. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 847–858. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  19. Tan, X., Jiang, B.: Optimum Sweeps of Simple Polygons with Two Guards. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 304–315. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  20. Tseng, L.H., Heffernan, P.J., Lee, D.T.: Two-guard walkability of simple polygons. Int. J. Comput. Geom. & Appl. 8(1), 85–116 (1998)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Dalian Maritime University, Linghai Road 1, Dalian, China

    Xuehou Tan

  2. School of Information Science and Technology, Tokai University, 4-1-1 Kitakaname, Hiratsuka, 259-1292, Japan

    Xuehou Tan & Bo Jiang

Authors
  1. Xuehou Tan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bo Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of North Carolina, CB 3175 Brooks Bldg, 27599-3175, Chapel Hill, NC, USA

    Jack Snoeyink

  2. Microsoft Research Asia, No 999, Zixing Road, Minhang District, 200241, Shanghai, China

    Pinyan Lu

  3. Peking University, Science BLK 1, No.5 Yiheyuan Road, Haidian District, 100871, Beijing, P.R.China

    Kaile Su

  4. Department of Computer Science, City University of Hong Kong, Tat Chee Ave., Kowloon, Hong Kong

    Lusheng Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tan, X., Jiang, B. (2012). Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds) Frontiers in Algorithmics and Algorithmic Aspects in Information and Management. Lecture Notes in Computer Science, vol 7285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29700-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29700-7_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29699-4

  • Online ISBN: 978-3-642-29700-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation