Convex polygons are cover-decomposable (Q2380774)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5691955
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convex polygons are cover-decomposable |
scientific article; zbMATH DE number 5691955 |
Statements
Convex polygons are cover-decomposable (English)
0 references
12 April 2010
0 references
It is proved that for every open polygon \(P\) there exists a constant \(k=k(P)\) such that every \(k\)-fold covering of the plane by translates of \(P\) can be decomposed into two coverings. The authors conjecture that there is a universal constant \(k\) such that every \(k\)-fold covering of the plane with translates of an arbitrary given quadrilateral can be decomposed into two coverings.
0 references
multiple covering
0 references
coverig
0 references
decomposability
0 references
wedges
0 references
polygon
0 references
0.919855773448944
0 references
0.8862147331237793
0 references
0.8793461322784424
0 references
0.878549337387085
0 references
0.8709096312522888
0 references