Advertisement

The Two-Guard Polygon Walk Problem

(Extended Abstract)
  • John Z. Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5532)

Abstract

Consider a simple polygon. A walk is conducted by two guards on the polygon boundary. They start at a boundary point and walk on the boundary. It is required that the two guards maintain their mutual visibility at all times and eventually meet together again. A polygon may or may not be walkable, depending on where the two guards start their walk or no matter where they start on the boundary. In this work, we characterize the class of walkable polygons by two guards by presenting a set of forbidden patterns.

Keywords

Boundary Point Computational Geometry Geometric Pattern Simple Polygon Analogous Property 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Icking, C., Klein, R.: The two guards problem. Int’l. J. of Computational Geometry and Applications 2(3), 257–285 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Heffernan, P.: An optimal algorithm for the two-guard problem. Int’l. J. of Computational Geometry and Applications 6, 15–44 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Crass, D., Suzuki, I., Yamashita, M.: Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem. Int’l. J. of Computational Geometry and Applications 5(4), 397–412 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Lee, J., Park, S.M., Chwa, K.Y.: Searching a polygonal room with one door by a 1-searcher. Int’l. J. of Computational Geometry and Applications 10(2), 201–220 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Lee, J.H., Shin, S.Y., Chwa, K.Y.: Visibility-based pursuit-evasions in a polygonal room with a door. In: Proc. ACM Symp. on Computational Geometry, pp. 281–290 (1999)Google Scholar
  6. 6.
    Park, S.M., Lee, J.H., Chwa, K.Y.: Characterization of rooms searchable by two guards. In: Proc. Int’l. Symp. on Algorithms and Computation, pp. 515–526 (2000)Google Scholar
  7. 7.
    Park, S.M., Lee, J.H., Chwa, K.Y.: Searching a room by two guards. Int’l. J. of Computational Geometry and Applications 12(4), 339–352 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Tan, X.: Efficient algorithms for searching a polygonal room with a door. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 2000. LNCS, vol. 2098, pp. 339–350. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Bhattacharya, B., Zhang, J.Z., Shi, Q.S., Kameda, T.: An optimal solution to room search problem. In: Proc. 18th Canadian Conf. on Computational Geometry, August 2006, pp. 55–58 (2006)Google Scholar
  10. 10.
    Zhang, J.Z., Kameda, T.: Where to build a door. In: Proc. IEEE/RSJ Int’l. Conf. on Intelligent Robots and Systems, October 2006, pp. 4084–4090 (2006)Google Scholar
  11. 11.
    Zhang, J.Z., Kameda, T.: A linear-time algorithm for finding all door locations that make a room searchable (extended abstract). In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 502–513. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  12. 12.
    Suzuki, I., Yamashita, M.: Searching for a mobile intruder in a polygonal region. SIAM J. on Computing 21(5), 863–888 (1992)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Tan, X.: Searching a simple polygon by a k-searcher. In: Proc. of Int’l. Symp. on Algorithms and Computation 2000, pp. 503–514 (2000)Google Scholar
  14. 14.
    Tan, X.: A Characterization of Polygonal Regions Searchable from the Boundary. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds.) IJCCGGT 2003. LNCS, vol. 3330, pp. 200–215. Springer, Heidelberg (2005)Google Scholar
  15. 15.
    Park, S.M., Lee, J.H., Chwa, K.Y.: A characterization of the class of polygons searchable by a 1-searcher. Technical Report CS/TR-2000-160, Korea Advanced Institute of Science and Technology (December 2000)Google Scholar
  16. 16.
    Kameda, T., Zhang, J.Z., Yamashita, M.: Simple characterization of polygons searchable by 1-searcher. In: Proc. the 18th Canadian Conf. on Computational Geometry, August 2006, pp. 113–116 (2006)Google Scholar
  17. 17.
    Zhang, J.Z., Burnett, B.: Yet another simple characterization of searchable polygons by 1-searcher. In: Proc. IEEE Int’l. Conf. on Robotics and Biomimetics, December 2006, pp. 1244–1249 (2006)Google Scholar
  18. 18.
    LaValle, S.M., Simov, B., Slutzki, G.: An algorithm for searching a polygonal region with a flashlight. Int’l. J. of Computational Geometry and Applications 12(1-2), 87–113 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Bhattacharya, B., Zhang, J.Z., Kameda, T.: Exploring polygonal area by robot: Searching testing. In: Proc. Int’l. Conf. on Robotics and Automation (May 2009) (to appear)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • John Z. Zhang
    • 1
  1. 1.Department of Mathematics and Computer ScienceUniversity of LethbridgeLethbridgeCanada

Personalised recommendations