Abstract
We consider the problem of locating guards inside a polygon under standard visibility and orthogonal visibility. Given a polygon, the maximum visibility problem ( MaxVP) asks for locating a point inside the polygon from which the visible area is maximized. Minimum visibility problem ( MinVP) is defined similarly. Under standard visibility, we show that the boundary point solution for MinVP can be obtained in O( n 3) time for simple orthogonal polygons and in O( n 3log n) time for orthogonal polygons with holes. For class 3 polygons under stair-case visibility, we show that the solution for MinVP lies on the boundary; this leads to an O( n 2) time algorithm to locate the solution.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call