DeepAI AI Chat
Log In Sign Up

Minimum Hidden Guarding of Histogram Polygons

by   Hamid Hoorfar, et al.

A hidden guard set G is a set of point guards in polygon P that all points of the polygon are visible from some guards in G under the constraint that no two guards may see each other. In this paper, we consider the problem for finding minimum hidden guard sets in histogram polygons under orthogonal visibility. Two points p and q are orthogonally visible if the orthogonal bounding rectangle for p and q lies within P . It is known that the problem is NP-hard for simple polygon with general visibility and it is true for simple orthogonal polygon. We proposed a linear time exact algorithm for finding minimum hidden guard set in histogram polygons under orthogonal visibility. In our algorithm, it is allowed that guards place everywhere in the polygon.


page 1

page 2

page 3

page 4


Guarding Path Polygons with Orthogonal Visibility

We are interested in the problem of guarding simple orthogonal polygons ...

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...

On approximations to minimum link visibility paths in simple polygons

We investigate a practical variant of the well-known polygonal visibilit...

The Visibility Center of a Simple Polygon

We introduce the visibility center of a set of points inside a polygon –...

Visibility Extension via Reflective Edges to an Exact Quantity

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

Art Gallery Problem with Rook Vision

We introduce rook visibility, which is a new model of visibility for the...

Expanding Visibility Polygons by Mirrors upto at least K units

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