The Painter's Problem: Covering a Grid with Colored Connected Polygons

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 subset of colors \(\chi _s \subseteq \chi \) and should be partitioned such that for each color \(c\in \chi _s\) at least one piece in the cell is identified with c. Cells assigned the empty color set remain white. We focus on the case where \(\chi = \{\text {red},\text {blue}\}\). Is it possible to partition each cell in the grid such that the unions of the resulting red and blue pieces form two connected polygons? We analyze the combinatorial properties and derive a necessary and sufficient condition for such a painting. We show that if a painting exists, there exists a painting with bounded complexity per cell. This painting has at most five colored pieces per cell if the grid contains white cells, and at most two colored pieces per cell if it does not.

[1]  David Eppstein,et al.  Maintenance of a minimum spanning forest in a dynamic planar graph , 1990, SODA '90.

[2]  Helen C. Purchase,et al.  Metrics for Graph Drawing Aesthetics , 2002, J. Vis. Lang. Comput..

[3]  Csaba D. Tóth,et al.  Multi-colored Spanning Graphs , 2016, GD.

[4]  Frank Harary,et al.  Graph Theory , 2016 .

[5]  David Auber,et al.  Visualise Undrawable Euler Diagrams , 2008, 2008 12th International Conference Information Visualisation.

[6]  Wouter Meulemans,et al.  Small Multiples with Gaps , 2017, IEEE Transactions on Visualization and Computer Graphics.

[7]  Bettina Speckmann,et al.  On Planar Supports for Hypergraphs , 2009, J. Graph Algorithms Appl..

[8]  Silvia Miksch,et al.  The State‐of‐the‐Art of Set Visualization , 2016, Comput. Graph. Forum.

[9]  Robert F. Cohen,et al.  Validating Graph Drawing Aesthetics , 1995, GD.

[10]  Bettina Speckmann,et al.  Kelp Diagrams: Point Set Membership Visualization , 2012, Comput. Graph. Forum.

[11]  Bettina Speckmann,et al.  Colored Spanning Graphs for Set Visualization , 2013, Graph Drawing.

[12]  Silvia Miksch,et al.  Radial Sets: Interactive Visual Analysis of Large Overlapping Sets , 2013, IEEE Transactions on Visualization and Computer Graphics.

[13]  Jason Dykes,et al.  Spatially Ordered Treemaps , 2008, IEEE Transactions on Visualization and Computer Graphics.

[14]  Timothy R. S. Walsh,et al.  Hypermaps versus bipartite maps , 1975 .

[15]  Erkki Mäkinen,et al.  How to draw a hypergraph , 1990, Int. J. Comput. Math..

[16]  Mary Czerwinski,et al.  Design Study of LineSets, a Novel Set Visualization Technique , 2011, IEEE Transactions on Visualization and Computer Graphics.

[17]  Tim Dwyer,et al.  Untangling Euler Diagrams , 2010, IEEE Transactions on Visualization and Computer Graphics.

[18]  Margaret E. Baron,et al.  A Note on the Historical Development of Logic Diagrams: Leibniz, Euler and Venn , 1969, The Mathematical Gazette.

[19]  Bettina Speckmann,et al.  KelpFusion: A Hybrid Set Visualization Technique , 2013, IEEE Transactions on Visualization and Computer Graphics.

[20]  Daniel W. Archambault,et al.  Fully Automatic Visualisation of Overlapping Sets , 2009, Comput. Graph. Forum.

[21]  Bettina Speckmann,et al.  Subdivision Drawings of Hypergraphs , 2009, GD.

[22]  M. Sheelagh T. Carpendale,et al.  Bubble Sets: Revealing Set Relations with Isocontours over Existing Visualizations , 2009, IEEE Transactions on Visualization and Computer Graphics.