Octants Are Cover-Decomposable

We prove that octants are cover-decomposable; i.e., any 12-fold covering of any subset of the space with a finite number of translates of a given octant can be decomposed into two coverings. As a corollary, we obtain that any 12-fold covering of any subset of the plane with a finite number of homothetic copies of a given triangle can be decomposed into two coverings. We also show that any 12-fold covering of the whole plane with the translates of a given open triangle can be decomposed into two coverings. However, we exhibit an indecomposable 3-fold covering with translates of a given triangle.

[1]  Balázs Keszegh,et al.  Weak Conflict-Free Colorings of Point Sets and Simple Regions , 2007, CCCG.

[2]  Dömötör Pálvölgyi,et al.  Indecomposable Coverings with Concave Polygons , 2010, Discret. Comput. Geom..

[3]  Kasturi R. Varadarajan.  Weighted geometric set cover via quasi-uniform sampling , 2010, STOC '10.

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

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

[6]  Dénes König,et al.  Theorie der endlichen und unendlichen Graphen : kombinatorische Topologie der Streckenkomplexe , 1935 .

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

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

[9]  Dömötör Pálvölgyi,et al.  Decomposition of Geometric Set Systems and Graphs , 2010, ArXiv.

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

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

[12]  Jean Cardinal,et al.  Coloring planar homothets and three-dimensional hypergraphs , 2011, Comput. Geom..

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

[14]  János Pach,et al.  Decomposition of multiple coverings into many parts , 2009, Comput. Geom..

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