Translative Packing of Unit Squares into Squares
نویسنده
چکیده
منابع مشابه
Translative Packing of Unit Squares into Equilateral Triangles
Every collection of n (arbitrary-oriented) unit squares can be packed translatively into any equilateral triangle of side length 2.3755 ̈ ? n. Let the coordinate system in the Euclidean plane be given. For 0 ≤ αi ă π{2, denote by Spαiq a square in the plane with sides of unit length and with an angle between the x-axis and a side of Spαiq equal to αi. Furthermore, let T psq be an equilateral tr...
متن کاملImproved Online Square-into-Square Packing
In this paper, we show an improved bound and new algorithm for the online square-into-square packing problem. This twodimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. The goal is to find the largest area α such that any set of squares with total area α can be packed. We show an algorithm that can pack an...
متن کامل2 Ja n 20 14 Improved Online Square - into - Square Packing ⋆ Brian
In this paper, we show an improved bound and new algorithm for the online square-into-square packing problem. This twodimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. The goal is to find the largest area α such that any set of squares with total area α can be packed. We show an algorithm that can pack an...
متن کاملImproved Bound for Online Square-into-Square Packing
We show a new algorithm and improved bound for the online square-into-square packing problem using a hybrid shelf-packing approach. This 2-dimensional packing problem involves packing an online sequence of squares into a unit square container without any two squares overlapping. We seek the largest area α such that any set of squares with total area at most α can be packed. We show an algorithm...
متن کاملPacking 10 or 11 Unit Squares in a Square
Let s(n) be the side of the smallest square into which it is possible pack n unit squares. We show that s(10) = 3 + √ 1 2 ≈ 3.707 and that s(11) ≥ 2 + 2 √ 4 5 ≈ 3.789. We also show that an optimal packing of 11 unit squares with orientations limited to 0◦ or 45◦ has side 2+2 √ 8 9 ≈ 3.886. These results prove Martin Gardner’s conjecture that n = 11 is the first case in which an optimal result r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2012 شماره
صفحات -
تاریخ انتشار 2012