enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    In the two-dimensional Euclidean plane, Joseph Louis Lagrange proved in 1773 that the highest-density lattice packing of circles is the hexagonal packing arrangement, [1] in which the centres of the circles are arranged in a hexagonal lattice (staggered rows, like a honeycomb), and each circle is surrounded by six other circles.

  3. Circle packing in a circle - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_a_circle

    Circle packing in a circle is a two-dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. Table of solutions, 1 ≤ n ≤ 20 [ edit ]

  4. Sphere packing - Wikipedia

    en.wikipedia.org/wiki/Sphere_packing

    The strictly jammed (mechanically stable even as a finite system) regular sphere packing with the lowest known density is a diluted ("tunneled") fcc crystal with a density of only π √ 2 /9 ≈ 0.49365. [6] The loosest known regular jammed packing has a density of approximately 0.0555. [7]

  5. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    The related circle packing problem deals with packing circles, possibly of different sizes, on a surface, for instance the plane or a sphere. The counterparts of a circle in other dimensions can never be packed with complete efficiency in dimensions larger than one (in a one-dimensional universe, the circle analogue is just two points). That is ...

  6. Circle packing in a square - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_a_square

    Circle packing in a square is a packing problem in recreational mathematics, where the aim is to pack n unit circles into the smallest possible square. Equivalently, the problem is to arrange n points in a unit square aiming to get the greatest minimal separation, d n , between points. [ 1 ]

  7. Density - Wikipedia

    en.wikipedia.org/wiki/Density

    In that case the density around any given location is determined by calculating the density of a small volume around that location. In the limit of an infinitesimal volume the density of an inhomogeneous object at a point becomes: ρ ( r → ) = d m / d V {\displaystyle \rho ({\vec {r}})=dm/dV} , where d V {\displaystyle dV} is an elementary ...

  8. Circle - Wikipedia

    en.wikipedia.org/wiki/Circle

    The sagitta (also known as the versine) is a line segment drawn perpendicular to a chord, between the midpoint of that chord and the arc of the circle. Given the length y of a chord and the length x of the sagitta, the Pythagorean theorem can be used to calculate the radius of the unique circle that will fit around the two lines: = +.

  9. Area density - Wikipedia

    en.wikipedia.org/wiki/Area_density

    A special type of area density is called column density (also columnar mass density or simply column density), denoted ρ A or σ. It is the mass of substance per unit area integrated along a path; [ 1 ] It is obtained integrating volumetric density ρ {\displaystyle \rho } over a column: [ 2 ] σ = ∫ ρ d s . {\displaystyle \sigma =\int \rho ...