Art gallery theorems and algorithms
Art gallery theorems and algorithms
Watchman routes under limited visibility
Computational Geometry: Theory and Applications
Proceedings of the eleventh annual symposium on Computational geometry
Handbook of computational geometry
Handbook of computational geometry
| Hi-index | 0.00 |
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 [4]. 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.