When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    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]

  3. Bin packing problem - Wikipedia

    en.wikipedia.org/wiki/Bin_packing_problem

    The bin packing problem[1][2][3][4] is an optimization problem, in which items of different sizes must be packed into a finite number of bins or containers, each of a fixed given capacity, in a way that minimizes the number of bins used. The problem has many applications, such as filling up containers, loading trucks with weight capacity ...

  4. Prism (geometry) - Wikipedia

    en.wikipedia.org/wiki/Prism_(geometry)

    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.

  5. Rectangle packing - Wikipedia

    en.wikipedia.org/wiki/Rectangle_packing

    Rectangle packing is a packing problem where the objective is to determine whether a given set of small rectangles can be placed inside a given large polygon, such that no two small rectangles overlap. Several variants of this problem have been studied.

  6. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    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. However, sphere packing problems can be ...

  7. De Bruijn's theorem - Wikipedia

    en.wikipedia.org/wiki/De_Bruijn's_theorem

    De Bruijn's theorem states that, if a harmonic brick is packed into a box, then the box must be a multiple of the brick. For instance, the three-dimensional harmonic brick with side lengths 1, 2, and 6 can only be packed into boxes in which one of the three sides is a multiple of six and one of the remaining two sides is even.

  8. Solid geometry - Wikipedia

    en.wikipedia.org/wiki/Solid_geometry

    Solid geometry or stereometry is the geometry of three-dimensional Euclidean space (3D space). [1] A solid figure is the region of 3D space bounded by a two-dimensional closed surface; for example, a solid ball consists of a sphere and its interior. Solid geometry deals with the measurements of volumes of various solids, including pyramids ...

  9. Paper bag problem - Wikipedia

    en.wikipedia.org/wiki/Paper_bag_problem

    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 ...