Optimal packing of similar triangles

DOI10.1016/0097-3165(95)90054-3MaRDI QIDQ1345878zbMATH OpenOpenAlexFDO

Publication date 6 November 1995

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(95)90054-3

Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Combinatorics in computer science (68R05)

Review text

\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.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Optimal packing of similar triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1345878)