Abstract
We show that for any open convex polygon P, there is a constant k(P) such that any k(P)-fold covering of the plane with translates of P can be decomposed into two coverings.
Article PDF
Similar content being viewed by others
References
Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Orden, D., Ramos, P.: Decomposition of multiple coverings into more parts. In preparation, arXiv:0807.0552v1
Brass, P., Pach, J., Moser, W.: Research Problems in Discrete Geometry. Springer, Berlin (2005)
Mani-Levitska, P., Pach, J.: Decomposition problems for multiple coverings with unit balls. Manuscript (1986)
Pach, J.: Decomposition of multiple packing and covering. Kolloq. Math. Inst. Univ. Salzburg. Diskrete Geom. 2, 169–178 (1980)
Pach, J.: Covering the plane with convex polygons. Discrete Comput. Geom. 1, 73–81 (1986)
Pach, J., Tóth, G.: Decomposition of multiple coverings into many parts. In: Proc. of the 23rd ACM Symposium on Computational Geometry (SoCG07) 2007, pp. 133–137. Also in: Comput. Geom. Theory Appl. 42, 127–133 (2009)
Pach, J., Tardos, G., Tóth, G.: Indecomposable coverings. In: The China–Japan Joint Conference on Discrete Geometry, Combinatorics and Graph Theory (CJCDGCGT 2005). Lecture Notes in Computer Science, vol. 4381, Springer, Berlin (2007)
Pálvölgyi, D.: Indecomposable coverings with concave polygons. In preparation
Tardos, G., Tóth, G.: Multiple coverings of the plane with triangles. Discrete Comput. Geom. 38, 443–450 (2007)
Author information
Authors and Affiliations
Corresponding author
Additional information
D. Pálvölgyi was supported by OTKA NK 67867.
G. Tóth was supported by OTKA T 038397 and T 046246.
Rights and permissions
About this article
Cite this article
Pálvölgyi, D., Tóth, G. Convex Polygons are Cover-Decomposable. Discrete Comput Geom 43, 483–496 (2010). https://doi.org/10.1007/s00454-009-9133-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-009-9133-y