Guarding Path Polygons with Orthogonal Visibility

09/05/2017
by   Hamid Hoorfar, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/19/2017

Minimum Hidden Guarding of Histogram Polygons

A hidden guard set G is a set of point guards in polygon P that all ...
research
08/04/2017

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...
research
08/19/2023

Securing Pathways with Orthogonal Robots

The protection of pathways holds immense significance across various dom...
research
06/08/2017

Mobile vs. point guards

We study the problem of guarding orthogonal art galleries with horizonta...
research
07/29/2017

Expanding Visibility Polygons by Mirrors upto at least K units

We consider extending visibility polygon (VP) of a given point q (VP(q))...
research
11/19/2018

Visibility Extension via Reflective Edges to an Exact Quantity

We consider extending the visibility polygon of a given point q, inside ...
research
04/26/2023

Covering simple orthogonal polygons with r-stars

We solve the r-star covering problem in simple orthogonal polygons, also...

Please sign up or login with your details

Forgot password? Click here to reset