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 distance between the centers along the shortest path namely that straight line will therefore be r 1 + r 2 where r 1 is the radius of the first sphere and r 2 is the radius of the second. In close packing all of the spheres share a common radius, r. Therefore, two centers would simply have a distance 2r.

  3. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    Packing squares in a square: Optimal solutions have been proven for n from 1-10, 14-16, 22-25, 33-36, 62-64, 79-81, 98-100, and any square integer. The wasted space is asymptotically O(a 3/5). Packing squares in a circle: Good solutions are known for n ≤ 35. The optimal packing of 10 squares in a square

  4. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    The cardinality of the edge set of the contact graph gives the number of touching pairs, the number of 3-cycles in the contact graph gives the number of touching triplets, and the number of tetrahedrons in the contact graph gives the number of touching quadruples (in general for a contact graph associated with a sphere packing in n dimensions ...

  5. Kissing number - Wikipedia

    en.wikipedia.org/wiki/Kissing_number

    Proof: Consider a circle with center C that is touched by circles with centers C 1, C 2, .... Consider the rays C C i. These rays all emanate from the same center C, so the sum of angles between adjacent rays is 360°. Assume by contradiction that there are more than six touching circles. Then at least two adjacent rays, say C C 1 and C C 2 ...

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

  7. Sphere - Wikipedia

    en.wikipedia.org/wiki/Sphere

    S ‍ 1: a 1-sphere is a circle of radius r; S ‍ 2: a 2-sphere is an ordinary sphere; S ‍ 3: a 3-sphere is a sphere in 4-dimensional Euclidean space. Spheres for n > 2 are sometimes called hyperspheres. The n-sphere of unit radius centered at the origin is denoted S ‍ n and is often referred to as "the" n-sphere. The ordinary sphere is a ...

  8. Sphere packing in a cylinder - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing_in_a_cylinder

    Sphere packing in a cylinder is a three-dimensional packing problem with the objective of packing a given number of identical spheres inside a cylinder of specified diameter and length. For cylinders with diameters on the same order of magnitude as the spheres, such packings result in what are called columnar structures .

  9. Spherical geometry - Wikipedia

    en.wikipedia.org/wiki/Spherical_geometry

    The principles of any of these geometries can be extended to any number of dimensions. An important geometry related to that of the sphere is that of the real projective plane; it is obtained by identifying antipodal points (pairs of opposite points) on the sphere. Locally, the projective plane has all the properties of spherical geometry, but ...