enow.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. Dimensional weight - Wikipedia

    en.wikipedia.org/wiki/Dimensional_weight

    The freight carrier will measure the longest dimension in each of the three axis (X, Y, Z) and use these measurements to determine the package volume. If the package is a right-angled rectangular box , then this will be equal to the true volume of the package. However, if the package is of any other shape, then the calculation of volume will be ...

  4. Surface-area-to-volume ratio - Wikipedia

    en.wikipedia.org/wiki/Surface-area-to-volume_ratio

    The surface-area-to-volume ratio has physical dimension inverse length (L −1) and is therefore expressed in units of inverse metre (m-1) or its prefixed unit multiples and submultiples. As an example, a cube with sides of length 1 cm will have a surface area of 6 cm 2 and a volume of 1 cm 3. The surface to volume ratio for this cube is thus

  5. Paper bag problem - Wikipedia

    en.wikipedia.org/wiki/Paper_bag_problem

    A cushion filled with stuffing. 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.

  6. Minimum bounding box algorithms - Wikipedia

    en.wikipedia.org/wiki/Minimum_bounding_box...

    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 of the objects in question. It is ...

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

  8. Parallelepiped - Wikipedia

    en.wikipedia.org/wiki/Parallelepiped

    The rectangular cuboid (six rectangular faces), cube ... Hence the volume of a parallelepiped is the product of the base area and the height ...

  9. Prism (geometry) - Wikipedia

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

    A right rectangular prism (with a rectangular base) is also called a cuboid, or informally a rectangular box. A right rectangular prism has Schläfli symbol { }×{ }×{ }. A right square prism (with a square base) is also called a square cuboid, or informally a square box. Note: some texts may apply the term rectangular prism or square prism to ...