Convex polygons are cover-decomposable

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.


Published in:
Discrete and Computational Geometry, 43, 3, 483-496
Year:
2010
Keywords:
Laboratories:




 Record created 2010-11-26, last modified 2018-01-28


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)