Suche
Ergebnisse
-
Conflict-free Chromatic Art Gallery Coverage
(2012)Leibniz International Proceedings in Informatics (LIPIcs) ~ 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)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-free covering of all n-vertex polygons? We call this the conflict-free chromatic art ...Conference Paper