Abstract
It is proved that for any centrally symmetric convex polygonal domainP and for any natural numberr, there exists a constantk=k(P, r) such that anyk-fold covering of the plane with translates ofP can be split intor simple coverings.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
J. Beck, Balanced two-colorings of finite sets in the squareI, Combinatorica 1 (1981), 327–335.
J. Beck and T. Fiala, “Integer-making” theorems, Discrete Applied Math. 3 (1981), 1–8.
G. Fejes Tóth, New results in the theory of packing and covering, in Convexity and its Applications (P. M. Gruber and J. M. Wills, eds.), Birkhäuser Verlag, Basel, 318–359 1983.
J. Pach, Decomposition of multiple packing and covering, Diskrete Geometrie, 2. Kolloq. Math. Inst. Univ. Salzburg, 169–178 1980.
C. A. Rogers, Packing and covering, Cambridge Tracts 54, Cambridge University Press, Cambridge, 1964.
K. F. Roth, On irregularities of distribution, Mathematika 7 (1954), 73–79.
W. M. Schmidt, Irregularities of distribution VII, Acta Arithmetica 21 (1972), 45–50.
F. A. Valentine, Convex Sets, McGraw-Hill, New York, 1964.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pach, J. Covering the plane with convex polygons. Discrete Comput Geom 1, 73–81 (1986). https://doi.org/10.1007/BF02187684
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187684