enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Close-packing of equal spheres - Wikipedia

    en.wikipedia.org/wiki/Close-packing_of_equal_spheres

    The same packing density can also be achieved by alternate stackings of the same close-packed planes of spheres, including structures that are aperiodic in the stacking direction. The Kepler conjecture states that this is the highest density that can be achieved by any arrangement of spheres, either regular or irregular.

  3. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    Here there is a choice between separating the spheres into regions of close-packed equal spheres, or combining the multiple sizes of spheres into a compound or interstitial packing. When many sizes of spheres (or a distribution) are available, the problem quickly becomes intractable, but some studies of binary hard spheres (two sizes) are ...

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

  5. Sphere packing in a sphere - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing_in_a_sphere

    Sphere packing in a sphere is a three-dimensional packing problem with the objective of packing a given number of equal spheres inside a unit sphere. It is the three-dimensional equivalent of the circle packing in a circle problem in two dimensions.

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

  7. Finite sphere packing - Wikipedia

    en.wikipedia.org/wiki/Finite_sphere_packing

    An arrangement in which the midpoint of all the spheres lie on a single straight line is called a sausage packing, as the convex hull has a sausage-like shape.An approximate example in real life is the packing of tennis balls in a tube, though the ends must be rounded for the tube to coincide with the actual convex hull.

  8. Kissing number - Wikipedia

    en.wikipedia.org/wiki/Kissing_number

    For a given sphere packing (arrangement of spheres) in a given space, a kissing number can also be defined for each individual sphere as the number of spheres it touches. For a lattice packing the kissing number is the same for every sphere, but for an arbitrary sphere packing the kissing number may vary from one sphere to another.

  9. File:Close-packed spheres, with umbrella light & camerea.jpg

    en.wikipedia.org/wiki/File:Close-packed_spheres...

    Mathematically, there is an infinite quantity of closest-packed arrangements (assuming an infinite-size volume in which to arrange spheres). In the field of crystal structure however, unit cells (a crystal’s repeating pattern) are composed of a limited number of atoms and this reduces the variety of closest-packed regular lattices found in ...