Loading...
research 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.
Type
research article
Web of Science ID
WOS:000274331500001
Authors
Publication date
2010
Published in
Volume
43
Issue
3
Start page
483
End page
496
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
November 26, 2010
Use this identifier to reference this record