Search results
Results From The WOW.Com Content Network
An a × b rectangle can be packed with 1 × n strips if and only if n divides a or n divides b. [15] [16] de Bruijn's theorem: A box can be packed with a harmonic brick a × a b × a b c if the box has dimensions a p × a b q × a b c r for some natural numbers p, q, r (i.e., the box is a multiple of the brick.) [15]
Common constraints of the problem include limiting small rectangle rotation to 90° multiples and requiring that each small rectangle is orthogonal to the large rectangle. This problem has some applications such as loading of boxes on pallets and, specifically, woodpulp stowage. As an example result: it is possible to pack 147 small rectangles ...
Prism (geometry) In geometry, a prism is a polyhedron comprising an n-sided polygon base, a second base which is a translated copy (rigidly moved without rotation) of the first, and n other faces, necessarily all parallelograms, joining corresponding sides of the two bases. All cross-sections parallel to the bases are translations of the bases.
In geometry, a hyperrectangle (also called a box, hyperbox, or orthotope[2]), is the generalization of a rectangle (a plane figure) and the rectangular cuboid (a solid figure) to higher dimensions. A necessary and sufficient condition is that it is congruent to the Cartesian product of finite intervals. If all of the edges are equal length, it ...
Peano–Jordan measure. In mathematics, the Peano–Jordan measure (also known as the Jordan content) is an extension of the notion of size (length, area, volume) to shapes more complicated than, for example, a triangle, disk, or parallelepiped. It turns out that for a set to have Jordan measure it should be well-behaved in a certain ...
Frustum. In geometry, a frustum (Latin for 'morsel'); [a] (pl.: frusta or frustums) is the portion of a solid (normally a pyramid or a cone) that lies between two parallel planes cutting the solid. In the case of a pyramid, the base faces are polygonal and the side faces are trapezoidal. A right frustum is a right pyramid or a right cone ...
Minimum bounding box algorithms. In computational geometry, the smallest enclosing box problem is that of finding the oriented minimum bounding box enclosing a set of points. It is a type of bounding volume. "Smallest" may refer to volume, area, perimeter, etc. of the box. It is sufficient to find the smallest enclosing box for the convex hull ...
In geometry, the paper bag problem or teabag problem is to calculate the maximum possible inflated volume of an initially flat sealed rectangular bag which has the same shape as a cushion or pillow, made out of two pieces of material which can bend but not stretch. According to Anthony C. Robin, an approximate formula for the capacity of a ...