Finding the shortest boundary guard of a simple polygon

Authors:
Bor-Kuan Lu;Fang-Rong Hsu;Chuan Yi Tang
Affiliations:
National Tsing Hua University, Taiwan;Providence University, Taiwan;National Tsing Hua University, Taiwan
Venue:
Theoretical Computer Science
Year:
2001

Citing 9
Cited 0

Art gallery theorems and algorithms

Art gallery theorems and algorithms
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
An Optimal Algorithm for Detecting Weak Visibility of a Polygon

IEEE Transactions on Computers
An algorithm for determining visibility of a simple polygon from an internal line segment

Journal of Algorithms
Optimal linear-time algorithm for the shortest illuminating line segment in a polygon

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
A pedestrian approach to ray shooting: shoot a ray, take a walk

SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
Optimally computing the shortest weakly visible subedge of a simple polygon

Journal of Algorithms
An Optimal Algorithm for Finding the Kernel of a Polygon

Journal of the ACM (JACM)
Finding all weakly-visible chords of a polygon in linear time

Nordic Journal of Computing

Quantified Score

Hi-index	5.23

Visualization

Abstract

There are many different kinds of guards in a simple polygon that have been proposed and discussed. In this paper, we consider a new type of guard, boundary guard, which is a guard capable of moving along a boundary of a polygon and every interior point of the polygon can be seen by the mobile guard. We propose an algorithm to 1nd the shortest boundary guard of a simple polygon P in O(n log n) time, where n is the number of vertices of P.