Search results
Results from the WOW.Com Content Network
The first nine blocks in the solution to the single-wide block-stacking problem with the overhangs indicated. In statics, the block-stacking problem (sometimes known as The Leaning Tower of Lire (Johnson 1955), also the book-stacking problem, or a number of other similar terms) is a puzzle concerning the stacking of blocks at the edge of a table.
Packing identical rectangles in a rectangle: The problem of packing multiple instances of a single rectangle of size (l,w), allowing for 90° rotation, in a bigger rectangle of size (L,W) has some applications such as loading of boxes on pallets and, specifically, woodpulp stowage. For example, it is possible to pack 147 rectangles of size (137 ...
English: Illustration of the first eight blocks in the solution to the single-wide block-stacking problem by CMG Lee. The wood textures are from File: 16 wood samples.jpg . Date
In the bin covering problem, the bin size is bounded from below: the goal is to maximize the number of bins used such that the total size in each bin is at least a given threshold. In the fair indivisible chore allocation problem (a variant of fair item allocation ), the items represent chores, and there are different people each of whom ...
Sphere packing finds practical application in the stacking of cannonballs. In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical size, and the space is usually three-dimensional Euclidean space.
The problem of close-packing of spheres was first mathematically analyzed by Thomas Harriot around 1587, after a question on piling cannonballs on ships was posed to him by Sir Walter Raleigh on their expedition to America. [5] Cannonballs were usually piled in a rectangular or triangular wooden frame, forming a three-sided or four-sided pyramid.
Square packing in a square is the problem of determining the maximum number of unit squares (squares of side length one) that can be packed inside a larger square of side length . If a {\displaystyle a} is an integer , the answer is a 2 , {\displaystyle a^{2},} but the precise – or even asymptotic – amount of unfilled space for an arbitrary ...
It is an open problem whether this holds true for all dimensions. This result only concerns spheres and not other convex bodies; in fact Gritzmann and Arhelger observed that for any dimension d ≥ 3 {\displaystyle d\geq 3} there exists a convex shape for which the closest packing is a pizza.