Max Willert

Learn More
We address recently proposed chromatic versions of the classic Art Gallery Problem. Assume a simple polygon P is guarded by a finite set of point guards and each guard is assigned one of t colors. Such a chromatic guarding is said to be conflict-free if each point p ∈ P sees at least one guard with a unique color among all guards visible from p. The goal is(More)
The chromatic art gallery problem asks for the minimum number of " colors " t so that a collection of point guards, each assigned one of the t colors, can see the entire polygon subject to some conditions on the colors visible to each point. In this paper, we explore this problem for orthogonal polygons using orthogonal visibility—two points p and q are(More)
  • 1