id: 00969102
dt: j
an: 00969102
au: Deogun, Jitender S.; Sarasamma, Suseela T.
ti: On the minimum co-operative guard problem.
so: J. Comb. Math. Comb. Comput. 22, 161-182 (1996).
py: 1996
pu: Charles Babbage Research Centre, Winnipeg
la: EN
cc: 
ut: minimum co-operative guards problem; art gallery problem
ci: 
li: 
ab: Summary: We study the minimum co-operative guards problem, a variation of
    the art gallery problem. First, we show that the minimum number of
    co-operative guards required for a $k$-spiral polygon is at most $N_k$,
    the total number of reflex vertices in the $k$-spiral. Then we classify
    2-spirals into seven different types based on the structure. Finally,
    we present a minimum co-operative guard placement algorithm for general
    2-spirals.
rv: