When.com Web Search

Search results

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

    en.wikipedia.org/wiki/Packing_problems

    Usually the packing must be without overlaps between goods and other goods or the container walls. In some variants, the aim is to find the configuration that packs a single container with the maximal packing density. More commonly, the aim is to pack all the objects into as few containers as possible. [1]

  3. Packing density - Wikipedia

    en.wikipedia.org/wiki/Packing_density

    The optimal packing density or packing constant associated with a supply collection is the supremum of upper densities obtained by packings that are subcollections of the supply collection. If the supply collection consists of convex bodies of bounded diameter, there exists a packing whose packing density is equal to the packing constant, and ...

  4. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    The strictly jammed (mechanically stable even as a finite system) regular sphere packing with the lowest known density is a diluted ("tunneled") fcc crystal with a density of only π √ 2 /9 ≈ 0.49365. [6] The loosest known regular jammed packing has a density of approximately 0.0555. [7]

  5. Lubachevsky–Stillinger algorithm - Wikipedia

    en.wikipedia.org/wiki/Lubachevsky–Stillinger...

    Using a variant of Lubachevsky-Stillinger algorithm, 1000 congruent isosceles triangles are randomly packed by compression in a rectangle with periodic (wrap-around) boundary. The rectangle which is the period of pattern repetition in both directions is shown. Packing density is 0.8776

  6. First-fit-decreasing bin packing - Wikipedia

    en.wikipedia.org/wiki/First-fit-decreasing_bin...

    First-fit-decreasing (FFD) is an algorithm for bin packing. Its input is a list of items of different sizes. Its input is a list of items of different sizes. Its output is a packing - a partition of the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity.

  7. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    A compact binary circle packing with the most similarly sized circles possible. [7] It is also the densest possible packing of discs with this size ratio (ratio of 0.6375559772 with packing fraction (area density) of 0.910683). [8] There are also a range of problems which permit the sizes of the circles to be non-uniform.

  8. Random close pack - Wikipedia

    en.wikipedia.org/wiki/Random_close_pack

    Random close packing (RCP) of spheres is an empirical parameter used to characterize the maximum volume fraction of solid objects obtained when they are packed randomly. For example, when a solid container is filled with grain, shaking the container will reduce the volume taken up by the objects, thus allowing more grain to be added to the container.

  9. Periodic boundary conditions - Wikipedia

    en.wikipedia.org/wiki/Periodic_boundary_conditions

    [4] The size of the simulation box must also be large enough to prevent periodic artifacts from occurring due to the unphysical topology of the simulation. In a box that is too small, a macromolecule may interact with its own image in a neighboring box, which is functionally equivalent to a molecule's "head" interacting with its own "tail".