Optimal Guard Placement Problem Under L-Visibility
Two points a and b in the presence of polygonal obstacles are L-visible if the length of the shortest path avoiding obstacles is no more than L. For a given convex polygon Q, Gewali et al . addressed the guard placement problem on the exterior boundary that will cover the maximum area exterior to the polygon under L-visibility. They proposed a linear time algorithm for some given value of L. When the length L is greater than half of the perimeter, they declared that problem as open. Here we address that open problem and present an algorithm whose time complexity is linear in number of vertices of the polygon.
KeywordsConvex Polygon Clockwise Direction Steiner Point Linear Time Algorithm Sector Angle
Unable to display preview. Download preview PDF.
- 1.Aronov, B., Davis, A.R., Dey, T.K., Pal, S.P., Prasad, D.C.: Visibility with reflection. In: Proc. of the 11th ACM symposium on computational geometry, pp. 316–325 (1995)Google Scholar
- 4.Gewali, L., Venkatasubramanian, R., Glasser, D.: Algorithms for Computing Grazing Area (unpublished results), http://www.egr.unlv.edu/~laxmi/
- 8.Shermer, T.: Recent results in Art Galleries. Proceedings of the IEEE, 1384–1399 (1992)Google Scholar