enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    The hexagonal packing of circles on a 2-dimensional Euclidean plane. These problems are mathematically distinct from the ideas in the circle packing theorem.The related circle packing problem deals with packing circles, possibly of different sizes, on a surface, for instance the plane or a sphere.

  3. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    Packing circles in simple bounded shapes is a common type of problem in recreational mathematics. The influence of the container walls is important, and hexagonal packing is generally not optimal for small numbers of circles. Specific problems of this type that have been studied include: Circle packing in a circle; Circle packing in a square

  4. Close-packing of equal spheres - Wikipedia

    en.wikipedia.org/wiki/Close-packing_of_equal_spheres

    Hexagonal close-packing would result in a six-sided pyramid with a hexagonal base. Collections of snowballs arranged in pyramid shape. The front pyramid is hexagonal close-packed and rear is face-centered cubic. The cannonball problem asks which flat square arrangements of cannonballs can be stacked into a square pyramid.

  5. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    Many problems in the chemical and physical sciences can be related to packing problems where more than one size of sphere is available. 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.

  6. Kepler conjecture - Wikipedia

    en.wikipedia.org/wiki/Kepler_conjecture

    A simple proof by Chau and Chung from 2010 uses the Delaunay triangulation for the set of points that are centers of circles in a saturated circle packing. [11] The hexagonal honeycomb conjecture The most efficient partition of the plane into equal areas is the regular hexagonal tiling. [12] Related to Thue's theorem. Dodecahedral conjecture

  7. Honeycomb conjecture - Wikipedia

    en.wikipedia.org/wiki/Honeycomb_conjecture

    It is also related to the densest circle packing of the plane, in which every circle is tangent to six other circles, which fill just over 90% of the area of the plane. The case when the problem is restricted to a square grid was solved in 1989 by Jaigyoung Choe who proved that the optimal figure is an irregular hexagon. [4] [5]

  8. Laves phase - Wikipedia

    en.wikipedia.org/wiki/Laves_phase

    The phases are classified on the basis of geometry alone. While the problem of packing spheres of equal size has been well-studied since Gauss, Laves phases are the result of his investigations into packing spheres of two sizes. Laves phases fall into three Strukturbericht types: cubic MgCu 2 (C15), hexagonal MgZn 2 (C14), and hexagonal MgNi 2 ...

  9. Hilbert's problems - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_problems

    Hilbert's problems are 23 problems in mathematics published by German mathematician David ... such as face-centered cubic close packing and hexagonal close packing. [k]