Optimal packing of similar triangles (Q1345878)

\textit{E. Kranakis}, \textit{L. Meertens} formulated in [EATCS Bull. 38, 181- 185 (1989; Zbl 0684.68054)] an algorithm (KM) packing a family of similar triangles with total area \(\alpha\) inside a similar triangle of area \(\leq 2 \alpha\). The author gives a counter example where, for this particular family of similar triangles, KM produces a covering triangle of area greater than \(2 \alpha\). He then modifies KM such that the covering triangle has in general area \(\leq 2 \alpha\) as claimed by Krankakis, Meertens. Suppose the triangles are numbered such that their areas \(h_ i\) do not increase then up to 10 triangles will be placed depending on the relative sizes of \(h_ 1,\ldots, h_{10}\). For the rest of them KM works in the original form.