Name
Abstract | ||
|---|---|---|
This paper solves the problem of subdividing a unit square into p rectangles of area 1/p in such a way that the maximal perimeter of a rectangle is as small as possible. The correctness of the solution is proved using the well-known theorems of Menger and Dilworth. |
Year | DOI | Venue |
|---|---|---|
1987 | 10.1016/0166-218X(87)90061-8 | Discrete Applied Mathematics |
Keywords | Field | DocType |
minimal perimeter | Square Shape,Discrete mathematics,Combinatorics,Rectangle,Correctness,Image processing,Decomposition method (constraint satisfaction),Perimeter,Unit square,Mathematics | Journal |
Volume | Issue | ISSN |
16 | 3 | Discrete Applied Mathematics |
Citations | PageRank | References |
9 | 1.25 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| T. Y. Kong | 1 | 82 | 16.38 |
| D. M. Mount | 2 | 71 | 11.07 |
| M. Werman | 3 | 343 | 112.04 |