DeepAI AI Chat
Log In Sign Up

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

by   Hamid Hoorfar, et al.

Given an orthogonal polygon P with n vertices, the goal of the watchman route problem is finding a path S of the minimum length in P such that every point of the polygon P is visible from at least one of the point of S . In the other words, in the watchman route problem we must compute a shortest watchman route inside a simple polygon of n vertices such that all the points interior to the polygon and on its boundary are visible to at least one point on the route. If route and polygon be orthogonal, it is called orthogonal watchman route problem. One of the targets of this problem is finding the orthogonal path with the minimum number of bends as possible. We present a linear-time algorithm for the orthogonal watchman route problem, in which the given polygon is monotone. Our algorithm can be used also for the problem on simple orthogonal polygons P for which the dual graph induced by the vertical decomposition of P is a path, which is called path 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 ...

APX-Hardness of the Minimum Vision Points Problem

Placing a minimum number of guards on a given watchman route in a polygo...

k-Transmitter Watchman Routes

We consider the watchman route problem for a k-transmitter watchman: sta...

Minimum Hidden Guarding of Histogram Polygons

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

Mobile vs. point guards

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

Online exploration outside a convex obstacle

A watchman route is a path such that a direct line of sight exists betwe...

Finding Route Hotspots in Large Labeled Networks

In many advanced network analysis applications, like social networks, e-...