DeepAI AI Chat
Log In Sign Up

Guarding Path Polygons with Orthogonal Visibility

by   Hamid Hoorfar, et al.

We are interested in the problem of guarding simple orthogonal polygons with the minimum number of r -guards. The interior point p belongs an orthogonal polygon P is visible from r -guard g , if the minimum area rectangle contained p and q lies within P . A set of point guards in polygon P is named guard set (as denoted G ) if the union of visibility areas of these point guards be equal to polygon P i.e. every point in P be visible from at least one point guards in G . For an orthogonal polygon, if dual graph of vertical decomposition is a path, it is named path polygon. In this paper, we show that the problem of finding the minimum number of r -guards (minimum guard set) becomes linear-time solvable in orthogonal path polygons. The path polygon may have dent edges in every four orientations. For this class of orthogonal polygon, the problem has been considered by Worman and Keil who described an algorithm running in O(n^17 poly n) -time where n is the size of the input polygon. The problem of finding minimum number of guards for simple polygon with general visibility is NP-hard, even if polygon be orthogonal. Our algorithm is purely geometric and presents a new strategy for r -guarding orthogonal polygons and guards can be placed everywhere in the interior and boundary of polygon.


page 1

page 2

page 3

page 4


Minimum Hidden Guarding of Histogram Polygons

A hidden guard set G is a set of point guards in polygon P that all ...

A Linear-time Algorithm for Orthogonal Watchman Route Problem with Minimum Bends

Given an orthogonal polygon P with n vertices, the goal of the watch...

Mobile vs. point guards

We study the problem of guarding orthogonal art galleries with horizonta...

Visibility Extension via Reflective Edges to an Exact Quantity

We consider extending the visibility polygon of a given point q, inside ...

Flip Paths Between Lattice Triangulations

The problem of finding a diagonal flip path between two triangulations h...

Expanding Visibility Polygons by Mirrors upto at least K units

We consider extending visibility polygon (VP) of a given point q (VP(q))...

Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour

We are interested in the problem of finding k nearest neighbours in the ...