<

Learning through research

Optimization in elementary geometry: case study

 A partition, admissible, symmetric, but not optimal


Here is a seemingly simple problem, belonging probably to recreational mathematics. I heard it somewhere long ago.

Problem. Partite a square into five convex polygons of equal diameter so as to minimize this diameter.

Clarification. The diameter of a convex polygon is the maximal length of all its edges and diagonals.

Do you know any algorithmic approach for solving such problems? I do not. If you do, please let us know.

The partition that usually comes to mind first is shown on Fig. 1. It is admissible (that is, meets the requirements: five convex polygons of equal diameter) and symmetric (as symmetric as the square). But it appears to be nonoptimal. Here the diameters (shown in green on Fig. 1) are equal to (of the side of the given square, assumed to be 1 from now), which follows easily from Pythagorean theorem.

 A better partition


A better partition is shown on Fig. 2. Here the diameters are equal to we observe that is less than which shows that the first partition is nonoptimal.

You may wonder, how did I find this better partition. This was a process involving, besides logic, such components as geometric intuition, trials and errors, insight, good luck. Let me explain it as far as I can.

My stating point was the observation that the fifth, the central part on Fig. 1 is effectively useless. It is formally needed just because we need five parts. Yes, but the partition of the square into four half-sized squares gives the same diameter! I asked myself: why so? how to benefit from the fifth part? I answered to myself: because the fifth part is isolated from the boundary of the given square; I should arrange five parts adjacent to the boundary.

This way I came to the configuration of Fig. 2, but with a parameter instead of the number not knowing yet, is this configuration better or worse than the first one. By Pythagorean theorem (again), the diameter in the lower three parts is but in the upper two parts. They must be equal, whence and finally Accordingly, as stated.

So... I still do not know, whether the second configuration is optimal, or not. Have you any idea? If you have, please let us know.

User:By doing

This article is issued from Wikiversity. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.