Covering simply connected regions by rectangles (Q1063613)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Covering simply connected regions by rectangles |
scientific article; zbMATH DE number 3918385
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering simply connected regions by rectangles |
scientific article; zbMATH DE number 3918385 |
Statements
Covering simply connected regions by rectangles (English)
0 references
1985
0 references
The authors prove that the ratio of the minimum number of rectangles covering a simply connected board (polyomino) B and the maximum number of points in B no two of which are contained in a common rectangle is less than 2.
0 references
covering by rectagles
0 references
polyomino
0 references
