When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    The sphere packing problem is the three-dimensional version of a class of ball-packing problems in arbitrary dimensions. In two dimensions, the equivalent problem is packing circles on a plane. In one dimension it is packing line segments into a linear universe. [10]

  3. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    Packing different rectangles in a rectangle: The problem of packing multiple rectangles of varying widths and heights in an enclosing rectangle of minimum area (but with no boundaries on the enclosing rectangle's width or height) has an important application in combining images into a single larger image. A web page that loads a single larger ...

  4. Finite sphere packing - Wikipedia

    en.wikipedia.org/wiki/Finite_sphere_packing

    For example, in the case =, it is known that the optimal packing is not a tetrahedral packing like the classical packing of cannon balls, but is likely some kind of octahedral shape. [ 1 ] The sudden transition in optimal packing shape is jokingly known by some mathematicians as the sausage catastrophe (Wills, 1985). [ 4 ]

  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. Hilbert's eighteenth problem - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_eighteenth_problem

    Hilbert's eighteenth problem is one of the 23 Hilbert problems set out in a celebrated list compiled in 1900 by mathematician David Hilbert. It asks three separate questions about lattices and sphere packing in Euclidean space. [1]

  7. Tammes problem - Wikipedia

    en.wikipedia.org/wiki/Tammes_problem

    In geometry, the Tammes problem is a problem in packing a given number of points on the surface of a sphere such that the minimum distance between points is maximized. It is named after the Dutch botanist Pieter Merkus Lambertus Tammes (the nephew of pioneering botanist Jantina Tammes ) who posed the problem in his 1930 doctoral dissertation on ...

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

  9. Category:Packing problems - Wikipedia

    en.wikipedia.org/wiki/Category:Packing_problems

    Upload file; Special pages; ... Download QR code; Print/export Download as PDF; Printable version; ... Sphere packing in a sphere; Square packing; Strip packing ...