Conflict-Free Chromatic Art Gallery Coverage


We consider a chromatic variant of the art gallery problem, where each guard is assigned one of k distinct colors. A placement of such colored guards is conflict-free if each point of the polygon is seen by some guard whose color appears exactly once among the guards visible to that point. What is the smallest number k(n) of colors that ensure a conflict… (More)
DOI: 10.1007/s00453-012-9732-5


12 Figures and Tables

Cite this paper

@article{Brtschi2012ConflictFreeCA, title={Conflict-Free Chromatic Art Gallery Coverage}, author={Andreas B{\"a}rtschi and Subhash Suri}, journal={Algorithmica}, year={2012}, volume={68}, pages={265-283} }