Abstract
Two points \(x, y\) inside a polygon \(P\) are said to be mutually link-2 visible if there exists the third point \(z \in P\) such that \(z\) is visible from both \(x\) and \(y\). The polygon \(P\) is link-2 \(LR\) -visible if there are two points \(s\), \(t\) on the boundary of \(P\) such that every point on the clockwise boundary of \(P\) from \(s\) to \(t\) is link-2 visible from some point of the other boundary of \(P\) from \(t\) to \(s\) and vice versa. We give a characterization of link-2 \(LR\)-visibility polygons by generalizing the known result on \(LR\)-visibility polygons. A main idea is to extend the concepts of ray-shootings and components to those under notion of link-2 visibility. Then, we develop an \(O(n \log n)\) time algorithm to determine whether a given polygon is link-2 \(LR\)-visible.
Using the characterization of link-2 \(LR\)-visibility polygons, we further present an \(O(n \log n)\) time algorithm for determining whether a polygonal region is searchable by a \(k\)-searcher, \(k \ge 2\), improving upon the previous \(O(n^2)\) time bound. A polygonal region is searchable by a searcher if the searcher can detect (or see) an unpredictable intruder inside the region, no matter how fast the intruder moves. A \(k\) -searcher holds \(k\) flashlights and can see only along the rays of the flashlights emanating from his position. Our result can also be used to simplify the existing solutions of other polygon search problems.
This work was partially supported by the Grant-in-Aid (MEXT/JSPS KAKENHI 23500024) for Scientific Research from Japan Society for the Promotion of Science and the National Natural Science Foundation of China under grant 61173034.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bhattacharya, B.K., Ghosh, S.K.: Characterizing \(LR\)-visibility polygons and related problems. Comput. Geom. Theory Appl. 18, 19–36 (2001)
Chazelle, B., Guibas, L.: Visibility and intersection problem in plane geometry. Discrete Comput. Geom. 4, 551–581 (1989)
Das, G., Heffernan, P.J., Narasimhan, G.: LR-visibility in polygons. Comput. Geom. Theory Appl. 7(1), 37–57 (1997)
Ghosh, S.K.: Visibility Problems in the Plane. Cambridge University Press, Cambridge (2007)
Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209–233 (1987)
Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci. 39, 126–152 (1989)
Hershberger, J.: A new data structure for shortest path queries in a simple polygon. Inform. Process. Lett. 38, 231–235 (1991)
Lee, J.H., Park, S.M., Chwa, K.Y.: Simple algorithms for searching a polygonal region with flashlights. Inform. Process. Lett. 81, 265–270 (2002)
Park, S.-M., Lee, J.-H., Chwa, K.-Y.: Visibility-based pursuit-evasion in a polygonal region by a searcher. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 456–468. Springer, Heidelberg (2001)
O’Rourke, J.: Computational Geometry in C. Cambridge University Press, Cambridge (1993)
Simov, B.H., Slutzki, G., LaValle, S.M.: Clearing a polygon with two 1-searchers. Int. J. Comput. Geom. Appl. 19, 59–92 (2009)
Suzuki, I., Yamashita, M.: Searching for mobile intruders in a polygonal region. SIAM J. Comp. 21(5), 863–888 (1992)
Tan, X.: A linear-time 2-approximation algorithm for the watchman route problem for simple polygons. Theor. Compt. Sci. 384(1), 92–103 (2007)
Tan, X., Jiang, B., Zhang, J.: Characterizing and recognizing \(LR\)-visibility polygons. Discrete Appl. Math. 165, 303–311 (2014)
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)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Tan, X., Zhang, J., Jiang, B. (2014). A Characterization of Link-2 LR-visibility Polygons with Applications. In: Akiyama, J., Ito, H., Sakai, T. (eds) Discrete and Computational Geometry and Graphs. JCDCGG 2013. Lecture Notes in Computer Science(), vol 8845. Springer, Cham. https://doi.org/10.1007/978-3-319-13287-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-13287-7_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13286-0
Online ISBN: 978-3-319-13287-7
eBook Packages: Computer ScienceComputer Science (R0)