Indecomposable Coverings with Concave Polygons

We show that for any concave polygon that has no parallel sides and for any k, there is a k-fold covering of some point set by the translates of this polygon that cannot be decomposed into two coverings. Moreover, we give a complete classification of open polygons with this property. We also construct for any polytope (having dimension at least three) and for any k, a k-fold covering of the space by its translates that cannot be decomposed into two coverings.

[1]  J. Pach,et al.  Decomposition problems for multiple coverings with unit balls, manuscript. , 1988 .

[2]  Márton Elekes,et al.  On splitting infinite-fold covers , 2009, 0911.2774.

[3]  Suresh Venkatasubramanian,et al.  Restricted strip covering and the sensor cover problem , 2007, SODA '07.

[4]  Qinglin Yu,et al.  Discrete Geometry, Combinatorics and Graph Theory , 2007 .

[5]  Gábor Tardos,et al.  Multiple Coverings of the Plane with Triangles , 2007, Discret. Comput. Geom..

[6]  János Pach,et al.  Indecomposable Coverings , 2005, Canadian Mathematical Bulletin.

[7]  János Pach,et al.  Covering the plane with convex polygons , 1986, Discret. Comput. Geom..

[8]  J. Pach.  Decomposition of multiple packing and covering , 1980 .

[9]  Jean Cardinal,et al.  Decomposition of Multiple Coverings into More Parts , 2008, SODA.

[10]  Géza Tóth,et al.  Convex Polygons are Cover-Decomposable , 2010, Discret. Comput. Geom..

[11]  Matt Gibson,et al.  Decomposing Coverings and the Planar Sensor Cover Problem , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.