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

DOI10.1007/978-3-319-73915-1_38zbMath1503.68283arXiv1709.00001OpenAlexW2752575458MaRDI QIDQ4625138

Wouter Meulemans, Irina Kostitsyna, Max Sondag, Jules Wulms, Arthur van Goethem, Marc J. van Kreveld

Publication date: 20 February 2019

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.00001

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items

Mapping multiple regions to the grid with bounded Hausdorff distance, The Painter’s Problem: Covering a Grid with Colored Connected Polygons, Short plane supports for spatial hypergraphs, Short Plane Supports for Spatial Hypergraphs

Cites Work

• Unnamed Item
• Multi-colored spanning graphs
• Hypermaps versus bipartite maps
• Colored Spanning Graphs for Set Visualization
• How to draw a hypergraph
• Subdivision Drawings of Hypergraphs
• Maintenance of a minimum spanning forest in a dynamic plane graph
• The Painter’s Problem: Covering a Grid with Colored Connected Polygons
• A Note on the Historical Development of Logic Diagrams: Leibniz, Euler and Venn
• On Planar Supports for Hypergraphs