Advertisement
Published in:
2006 | OriginalPaper | Chapter
Optimal Guard Placement Problem Under L-Visibility
Authors : Debabrata Bardhan, Sasanka Roy, Sandip Das
Published in: Computational Science and Its Applications - ICCSA 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.