Octants are cover-decomposable into many coverings

Aloupis, 2010, Decomposition of multiple coverings into more parts, Discrete Comput. Geom., 44, 706, 10.1007/s00454-009-9238-3 Asinowski, 2013, Coloring hypergraphs induced by dynamic point sets and bottomless rectangles, vol. 8037 Buchsbaum, 2007, Restricted strip covering and the sensor cover problem, 1056 Jean Cardinal, personal communication. Cardinal, 2012, Coloring planar homothets and three-dimensional hypergraphs, vol. 7256, 121 Gibson, 2011, Decomposing coverings and the planar sensor cover problem, Discrete Comput. Geom., 46, 313, 10.1007/s00454-011-9353-9 Keszegh, 2012, Coloring half-planes and bottomless rectangles, Comput. Geom., 45, 495, 10.1016/j.comgeo.2011.09.004 Keszegh, 2007, Weak conflict-free colorings of point sets and simple regions, 97 Keszegh, 2012, Octants are Cover Decomposable, Discrete Comput. Geom., 47, 598, 10.1007/s00454-011-9377-1 Keszegh, 2013, Online and quasi-online colorings of wedges and intervals, vol. 7741, 292 Pach, 1980, Decomposition of multiple packing and covering, Diskrete Geometrie, 2. Kolloq. Math. Inst. Univ. Salzburg, 169 Pach, 1986, Covering the plane with convex polygons, Discrete Comput. Geom., 1, 73, 10.1007/BF02187684 J. Pach, D. Pálvölgyi, G. Tóth, Survey on the Decomposition of Multiple Coverings, in press. Pach, 2009, Indecomposable coverings, Can. Math. Bull., 52, 451, 10.4153/CMB-2009-048-x Pach, 2007, Decomposition of multiple coverings into many parts, 133 Pálvölgyi Pálvölgyi, 2010, Indecomposable coverings with concave polygons, Discrete Comput. Geom., 44, 577, 10.1007/s00454-009-9194-y Pálvölgyi, 2010, Convex polygons are cover-decomposable, Discrete Comput. Geom., 43, 483, 10.1007/s00454-009-9133-y Tardos, 2007, Multiple coverings of the plane with triangles, Discrete Comput. Geom., 38, 443, 10.1007/s00454-007-1345-4 Varadarajan, 2010, Weighted geometric set cover via quasi-uniform sampling, 641