Guarding exterior region of a simple polygon

Authors:
Arindam Karmakar;Sasanka Roy;Sandip Das
Affiliations:
Indian Statistical Institute, Kolkata, India;Tata Consultancy Services, Pune, India;Indian Statistical Institute, Kolkata, India
Venue:
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Year:
2008

Citing 5
Cited 0

Art gallery theorems and algorithms

Art gallery theorems and algorithms
Computing geodesic furthest neighbors in simple polygons

Journal of Computer and System Sciences
Computing the external geodesic diameter of a simple polygon

Computing
Computing external farthest neighbors for a simple polygon

Discrete Applied Mathematics
Handbook of computational geometry

Handbook of computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, our objective is to locate a position of a guard on the convex hull of a simple polygon P, such that, the farthest point on the boundary of the polygon from the location of the guard, avoiding the interior region of the polygon P, is minimum among all possible locations of the guard on the convex hull. In other words, we try to identify the possible position of guard on the boundary of convex hull such that the maximum distance required to reach a trouble point on the boundary of polygon P avoiding the interior region of P is minimized. The time complexity of our algorithm is O(n) where n is the number of vertices of P.