This is a paper about (parallel) packing squares into triangles. For a planar polygon \(P\) with a distinguished side (called base) denote by \(\varrho(P)\) the greatest real number \(r\) such that any collection of squares whose total area does not exceed \(r \cdot |P|\) can be packed into \(P\) in a way such that all these squares have pairwise disjoint interiors and one of the sides of each of them is parallel to the base of \(P\).\par The main result of the paper gives a simple formula for \(\varrho(T_h)\) (as a function of \(h\)) for a triangle \(T_h\) with base of length \(1\), height \(h\) and interior angles at the base of measure not exceeding \(90^o\). This covers certain already known partial results on parallel packing squares into triangles.\par The authors present also some ideas on packing squares into trapezoids.
- A note on perfect packing of squares and cubes
- A note on three Moser's problems and two Paulhus' lemmas
- An algorithm for packing squares
- scientific article; zbMATH DE number 125447 (Why is no real title available?)
- On packing of rectangles in a rectangle
- On packing squares with equal squares
- On parallel packing and covering of squares and cubes
- Parallel packing and covering of an equilateral triangle with sequences of squares
- Perfect square packings
- Some packing and covering theorems
This page was built for publication: Parallel packing squares into a triangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2073928)
