SUPPORT THE WORK

GetWiki

packing density

ARTICLE SUBJECTS
aesthetics  →
being  →
complexity  →
database  →
enterprise  →
ethics  →
fiction  →
history  →
internet  →
knowledge  →
language  →
licensing  →
linux  →
logic  →
method  →
news  →
perception  →
philosophy  →
policy  →
purpose  →
religion  →
science  →
sociology  →
software  →
truth  →
unix  →
wiki  →
ARTICLE TYPES
essay  →
feed  →
help  →
system  →
wiki  →
ARTICLE ORIGINS
critical  →
discussion  →
forked  →
imported  →
original  →
packing density
[ temporary import ]
please note:
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki
{{short description|Fraction of a space filled by objects packed into that space}}A packing density or packing fraction of a packing in some space is the fraction of the space filled by the figures making up the packing. In simplest terms, this is the ratio of the volume of bodies in a space to the volume of the space itself. In packing problems, the objective is usually to obtain a packing of the greatest possible density.

In compact spaces

If {{math|K1,...,Kn}} are measurable subsets of a compact measure space {{math|X}}and their interiors pairwise do not intersect, then the collection {{math|[Ki]}} is a packing in {{math|X}} and its packing density is
eta = frac{sum_{i=1}^{n}mu(K_i)}{mu(X)}.

In Euclidean space

If the space being packed is infinite in measure, such as Euclidean space, it is customary to define the density as the limit of densities exhibited in balls of larger and larger radii. If {{math|B't}} is the ball of radius {{math|t}} centered at the origin, then the density of a packing {{math|[K'i : i∈mathbb{N}]}} is
eta = lim_{ttoinfty}frac{sum_{i=1}^{infty}mu(K_icap B_t)}{mu(B_t)}.
Since this limit does not always exist, it is also useful to define the upper and lower densities as the limit superior and limit inferior of the above respectively. If the density exists, the upper and lower densities are equal. Provided that any ball of the Euclidean space intersects only finitely many elements of the packing and that the diameters of the elements are bounded from above, the (upper, lower) density does not depend on the choice of origin, and {{math|μ(K'i∩B't)}} can be replaced by {{math|μ(K'i)}} for every element that intersects {{math|B't}}.{{citation
| last = Groemer | first = H.
| journal = Discrete and Computational Geometry
| pages = 183–193
| title = Some basic properties of packing and covering constants
| doi = 10.1007/BF02187693
| volume = 1
| issue = 2
| year = 1986| doi-access = free
}}
The ball may also be replaced by dilations of some other convex body, but in general the resulting densities are not equal.

Optimal packing density

One is often interested in packings restricted to use elements of a certain supply collection. For example, the supply collection may be the set of all balls of a given radius. 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 this packing constant does not vary if the balls in the definition of density are replaced by dilations of some other convex body.A particular supply collection of interest is all Euclidean motions of a fixed convex body {{math|K}}. In this case, we call the packing constant the packing constant of {{math|K}}. The Kepler conjecture is concerned with the packing constant of 3-balls. Ulam's packing conjecture states that 3-balls have the lowest packing constant of any convex solid. All translations of a fixed body is also a common supply collection of interest, and it defines the translative packing constant of that body.

See also

References

{{Reflist}}

External links

  • {{Mathworld |urlname=PackingDensity |title=Packing Density}}


- content above as imported from Wikipedia
- "packing density" does not exist on GetWiki (yet)
- time: 2:50pm EDT - Thu, Apr 25 2024
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 23 MAY 2022
GETWIKI 09 JUL 2019
Eastern Philosophy
History of Philosophy
GETWIKI 09 MAY 2016
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
GETWIKI 20 AUG 2014
CONNECT