When.com Web Search

Search results

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

    en.wikipedia.org/wiki/Circle_packing

    The most efficient way to pack different-sized circles together is not obvious. In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that no circle can be enlarged without creating an overlap.

  3. Tetrahedron packing - Wikipedia

    en.wikipedia.org/wiki/Tetrahedron_packing

    Tetrahedral packaging. Aristotle claimed that tetrahedra could fill space completely. [4] [5]In 2006, Conway and Torquato showed that a packing fraction about 72% can be obtained by constructing a non-Bravais lattice packing of tetrahedra (with multiple particles with generally different orientations per repeating unit), and thus they showed that the best tetrahedron packing cannot be a ...

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

  5. Fraction - Wikipedia

    en.wikipedia.org/wiki/Fraction

    A simple fraction (also known as a common fraction or vulgar fraction, where vulgar is Latin for "common") is a rational number written as a/b or ⁠ ⁠, where a and b are both integers. [9] As with other fractions, the denominator (b) cannot be zero. Examples include ⁠ 1 / 2 ⁠, − ⁠ 8 / 5 ⁠, ⁠ −8 / 5 ⁠, and ⁠ 8 / −5 ⁠

  6. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    Sphere packing finds practical application in the stacking of cannonballs.. In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space.

  7. Close-packing of equal spheres - Wikipedia

    en.wikipedia.org/wiki/Close-packing_of_equal_spheres

    Carl Friedrich Gauss proved that the highest average density – that is, the greatest fraction of space occupied by spheres – that can be achieved by a lattice packing is π 3 2 ≈ 0.74048 {\displaystyle {\frac {\pi }{3{\sqrt {2}}}}\approx 0.74048} .

  8. Fractionation - Wikipedia

    en.wikipedia.org/wiki/Fractionation

    [1] [2] Fractions are collected based on differences in a specific property of the individual components. A common trait in fractionations is the need to find an optimum between the amount of fractions collected and the desired purity in each fraction. Fractionation makes it possible to isolate more than two components in a mixture in a single run.

  9. Atomic packing factor - Wikipedia

    en.wikipedia.org/wiki/Atomic_packing_factor

    The primitive unit cell for the body-centered cubic crystal structure contains several fractions taken from nine atoms (if the particles in the crystal are atoms): one on each corner of the cube and one atom in the center. Because the volume of each of the eight corner atoms is shared between eight adjacent cells, each BCC cell contains the ...