The Painter's Problem: covering a grid with colored connected polygons

Arthur van Goethem, Irina Kostitsyna, Marc van Kreveld +3

Motivated by a new way of visualizing hypergraphs, we study the following problem. Consider a rectangular grid and a set of colors $\chi$. Each cell $s$ in the grid is assigned a subs…