Abstract
We show that if the unit square is covered by n rectangles, then at least one must have perimeter at least 4(2 m+1)/(n+m(m+1)), where m is the largest integer whose square is at most n. This result is exact for n of the form m(m+1) (or m2).
Original language | English |
---|---|
Pages (from-to) | 1-7 |
Number of pages | 7 |
Journal | Discrete and Computational Geometry |
Volume | 1 |
Issue number | 1 |
DOIs | |
State | Published - Dec 1986 |
Externally published | Yes |