When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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 ...

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

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

  5. List of shapes with known packing constant - Wikipedia

    en.wikipedia.org/wiki/List_of_shapes_with_known...

    The packing constant of a geometric body is the largest average density achieved by packing arrangements of congruent copies of the body. For most bodies the value of the packing constant is unknown. [1] The following is a list of bodies in Euclidean spaces whose packing constant is known. [1]

  6. Ellipsoid packing - Wikipedia

    en.wikipedia.org/wiki/Ellipsoid_packing

    In geometry, ellipsoid packing is the problem of arranging identical ellipsoid throughout three-dimensional space to fill the maximum possible fraction of space. The currently densest known packing structure for ellipsoid has two candidates, a simple monoclinic crystal with two ellipsoids of different orientations [1] and a square-triangle crystal containing 24 ellipsoids [2] in the ...

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

  8. Close-packing of equal spheres - Wikipedia

    en.wikipedia.org/wiki/Close-packing_of_equal_spheres

    [1] [2] Highest density is known only for 1, 2, 3, 8, and 24 dimensions. [3] Many crystal structures are based on a close-packing of a single kind of atom, or a close-packing of large ions with smaller ions filling the spaces between them. The cubic and hexagonal arrangements are very close to one another in energy, and it may be difficult to ...

  9. Circle packing in a circle - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_a_circle

    Of these, solutions for n = 2, 3, 4, 7, 19, and 37 achieve a packing density greater than any smaller number > 1. (Higher density records all have rattles.) [10] See also