enow.com Web Search

Search results

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

    en.wikipedia.org/wiki/Circle_packing

    While the circle has a relatively low maximum packing density, it does not have the lowest possible, even among centrally-symmetric convex shapes: the smoothed octagon has a packing density of about 0.902414, the smallest known for centrally-symmetric convex shapes and conjectured to be the smallest possible. [3]

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

  5. 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]

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

  7. Number density - Wikipedia

    en.wikipedia.org/wiki/Number_density

    Using the number density as a function of spatial coordinates, the total number of objects N in the entire volume V can be calculated as = (,,), where dV = dx dy dz is a volume element. If each object possesses the same mass m 0 , the total mass m of all the objects in the volume V can be expressed as m = ∭ V m 0 n ( x , y , z ) d V ...

  8. Specific volume - Wikipedia

    en.wikipedia.org/wiki/Specific_volume

    For a substance X with a specific volume of 0.657 cm 3 /g and a substance Y with a specific volume 0.374 cm 3 /g, the density of each substance can be found by taking the inverse of the specific volume; therefore, substance X has a density of 1.522 g/cm 3 and substance Y has a density of 2.673 g/cm 3. With this information, the specific ...

  9. Packing density - Wikipedia

    en.wikipedia.org/wiki/Packing_density

    The optimal packing density or packing constant associated with a supply collection is the supremum of upper densities obtained by packings that are subcollections of the supply collection. If the supply collection consists of convex bodies of bounded diameter, there exists a packing whose packing density is equal to the packing constant, and ...