Infoscience

Journal article

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.

Fulltext

Related material