enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Dimensional weight - Wikipedia

    en.wikipedia.org/wiki/Dimensional_weight

    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 more than the true volume of the package. Dimensional weight is also known as DIM weight, volumetric weight, or cubed weight.

  3. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    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]

  4. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    As the local density of a packing in an infinite space can vary depending on the volume over which it is measured, the problem is usually to maximise the average or asymptotic density, measured over a large enough volume. For equal spheres in three dimensions, the densest packing uses approximately 74% of the volume.

  5. Close-packing of equal spheres - Wikipedia

    en.wikipedia.org/wiki/Close-packing_of_equal_spheres

    To form an A-B-A-B-... hexagonal close packing of spheres, the coordinate points of the lattice will be the spheres' centers. Suppose, the goal is to fill a box with spheres according to HCP. The box would be placed on the x-y-z coordinate space. First form a row of spheres. The centers will all lie on a straight line.

  6. Volume of an n-ball - Wikipedia

    en.wikipedia.org/wiki/Volume_of_an_n-ball

    The volume of a n-ball is the Lebesgue measure of this ball, which generalizes to any dimension the usual volume of a ball in 3-dimensional space. The volume of a n -ball of radius R is R n V n , {\displaystyle R^{n}V_{n},} where V n {\displaystyle V_{n}} is the volume of the unit n -ball , the n -ball of radius 1 .

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

  8. Volume - Wikipedia

    en.wikipedia.org/wiki/Volume

    Some SI units of volume to scale and approximate corresponding mass of water. To ease calculations, a unit of volume is equal to the volume occupied by a unit cube (with a side length of one). Because the volume occupies three dimensions, if the metre (m) is chosen as a unit of length, the corresponding unit of volume is the cubic metre (m 3).

  9. Minimum bounding box - Wikipedia

    en.wikipedia.org/wiki/Minimum_bounding_box

    A sphere enclosed by its axis-aligned minimum bounding box (in 3 dimensions) In geometry, the minimum bounding box or smallest bounding box (also known as the minimum enclosing box or smallest enclosing box) for a point set S in N dimensions is the box with the smallest measure (area, volume, or hypervolume in higher dimensions) within which all the points lie.