Partitioning a rectangle into small perimeter rectangles (Q1197044)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Partitioning a rectangle into small perimeter rectangles |
scientific article |
Statements
Partitioning a rectangle into small perimeter rectangles (English)
0 references
16 January 1993
0 references
The authors discuss the following question: How can one partition the unit square into \(n\) rectangles with edges parallel to the axes, so as to minimize the largest perimeter among the rectangles. They prove that the best construction for \(n=k^ 2+s\), with \(s=1\) or \(s=-1\), has \(k-1\) rows of \(k\) identical rectangles and one row of \(k+s\) identical rectangles, with all rectangles having the same perimeter. Also discussed is the analogous problem for partitioning a rectangle into \(n\) smaller rectangles.
0 references
partition
0 references
square
0 references
rectangles
0 references
perimeter
0 references