Abstract
Jack and Jill want to play hide-and-seek on the boundary of a simple polygon. Given arbitrary paths for the two children along this boundary, our goal is to determine whether Jack can walk along his path without ever being seen by Jill. To solve this problem, we use a linear-sized skeleton invisibility diagram to implicitly represent invisibility information between pairs of points on the boundary of the simple polygon. This structure has additional applications for any polygon walk problem where one entity wishes to remain hidden throughout a traversal of some path. We also show how Jack can avoid being seen not just by one moving child but by an arbitrary number of moving children.
This work is supported by Shenzhen Key Laboratory of High Performance Data Mining (grant no. CXB201005250021A).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Sharir, M.: Davenport–Schinzel Sequences and Their Geometric Applications. In: Handbook of Computational Geometry, pp. 1–47. Elsevier, Amsterdam (2000)
Cook IV, A.F., Fan, C., Luo, J.: Hide-and-seek: A linear time algorithm for polygon walk problems. In: 26th European Workshop on Computational Geometry (EuroCG), pp. 121–124 (2010)
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: 11th Symposium on Discrete Algorithms (SODA), pp. 927–936 (2000)
Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear time algorithms for visibility and shortest path problems inside simple polygons. In: 2nd Symposium on Computational Geometry (SoCG), pp. 1–13 (1986)
Heffernan, P.J.: An optimal algorithm for the two-guard problem. In: 9th Symposium on Computaitonal Geometry (SoCG), pp. 348–358 (1993)
Icking, C., Klein, R.: The two guards problem. In: 7th Symposium on Computational Geometry (SoCG), pp. 166–175 (1991)
LaValle, S.M., Simov, B.H., Slutzki, G.: An algorithm for searching a polygonal region with a flashlight. In: 16th Symposium on Computational Geometry (SoCG), pp. 260–269 (2000)
Suzuki, I., Tazoe, Y., Yamashita, M., Kameda, T.: Searching a polygonal region from the boundary. International Journal of Computational Geometry and Applications 11, 529–553 (2000)
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)
Thurimella, R., Lopez, M.A.: On computing connected components of line segments. IEEE Transactions on Computers 44, 597–601 (1995)
Zhang, J.Z., Kameda, T.: A linear-time algorithm for finding all door locations that make a room searchable. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 502–513. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cook, A.F., Fan, C., Luo, J. (2011). Hide-and-Seek: Algorithms for Polygon Walk Problems. In: Ogihara, M., Tarui, J. (eds) Theory and Applications of Models of Computation. TAMC 2011. Lecture Notes in Computer Science, vol 6648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20877-5_48
Download citation
DOI: https://doi.org/10.1007/978-3-642-20877-5_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20876-8
Online ISBN: 978-3-642-20877-5
eBook Packages: Computer ScienceComputer Science (R0)