On packing unequal rectangles in the unit square (Q1337180): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0097-3165(94)90116-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2033869542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing of squares and cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some packing and covering theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tiling the unit square with squares and rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolved problems in geometry / rank
 
Normal rank

Latest revision as of 09:05, 23 May 2024

scientific article
Language Label Description Also known as
English
On packing unequal rectangles in the unit square
scientific article

    Statements

    On packing unequal rectangles in the unit square (English)
    0 references
    0 references
    30 November 1994
    0 references
    The author shows that all the rectangles of size \(1 /n \times 1/(n + 1)\), \(n = 1, 2, \dots,\) can be packed into a square of size 133/132.
    0 references
    packing
    0 references
    unit square
    0 references
    rectangles
    0 references
    0 references

    Identifiers