Abstract
In this paper, our objective is to locate a position of a guard on the convex hull of a simple polygon P, such that, the farthest point on the boundary of the polygon from the location of the guard, avoiding the interior region of the polygon P, is minimum among all possible locations of the guard on the convex hull. In other words, we try to identify the possible position of guard on the boundary of convex hull such that the maximum distance required to reach a trouble point on the boundary of polygon P avoiding the interior region of P is minimized. The time complexity of our algorithm is O(n) where n is the number of vertices of P.
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., Aggarwal, A., Aronov, B., Kosaraju, S.R., Schieber, B., Suri, S.: Computing external farthest neighbors for a simple polygon. Discrete Applied Mathematics 31, 97–111 (1991)
Aronov, B., Fortune, S., Wilfong, G.: The furthest-site geodesic voronoi diagram. Discrete Computational Geometry 9, 217–255 (1993)
Chvatal, V.: A combinatorial theorem in plane geometry. Journal of combinatorial Theory SER B 18, 39–41 (1975)
Choi, A.K.O., Yiu, S.M.: Edge guards for the fortress problem. Journal of Geometry 72, 47–64 (2001)
Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons. Algorithmica 2, 209–233 (1987)
McCallum, D., Avis, D.: A linear Algorithm for Finding the Convex Hull of a Simple Polygon. Information Processing Letters 9, 201–206 (1979)
O’Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, Oxford (1987)
Peshkin, M.A., Sanderson, A.C.: Reachable Grasps on a Polygon: The Convex Rope Algorithm. IEEE Journal of Robotics and Automation RA-2, 53–58 (1986)
Sack, J.R., Urrutia, J.: Handbook of computational geometry. Elsevier Science, B. V., Netherlands (2000)
Samuel, D., Toussaint, G.T.: Computing the external geodesic diameter of a simple polygon. Computing 44, 1–19 (1990)
Shermer, T.: Recent results in Art Galleries. Proceedings of the IEEE, 1384–1399 (1992)
Suri, S.: Computing Geodesic Furthest Neighbors in Simple Polygons. Journal of Computer and System Sciences 39, 220–235 (1989)
Yiu, S.M.: A generalized fortress problem using k-consecutive vertex guards. Journal of Geometry 39, 220–235 (1989)
Zylinski, P.: Cooperative guards in the fortress problem. Balkan Journal of Geometry and Its Applications 72, 188–198 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karmakar, A., Roy, S., Das, S. (2008). Guarding Exterior Region of a Simple Polygon. In: Nakano, Si., Rahman, M.S. (eds) WALCOM: Algorithms and Computation. WALCOM 2008. Lecture Notes in Computer Science, vol 4921. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77891-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-77891-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77890-5
Online ISBN: 978-3-540-77891-2
eBook Packages: Computer ScienceComputer Science (R0)