Guard Sufficiency Set for Simple Polygons
Tae-Cheon Yang, Chan-Su Sin · Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon · 2001
Let P be a simple polygon of n vertices. A point p ∈ P another point q ∈ P if an open segment connecting p and q does not intersect the boundary of P. A Guard Sufficiency Set(GSS) for P is defined to be a set of points( viewpoints ), S ⊂ P, such that if a subset G ⊂ P sees every point of S, then G sees every point of P. This GSS problem is a variant of well-investigated classical Art Gallery problems. In this paper, we introduce several GSS characterization problems for polygons, and present some solutions of them.