Packing density

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.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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. \eta=\frac{\sum_{i=1}^{n}\mu(K_i)}{\mu(X)}. \eta = \lim_{t\to\infty}\frac{\sum_{i=1}^{\infty}\mu(K_i\cap 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 \mu(K_i\cap B_t) can be replaced by \mu(K_i) for every element that intersects B_t . The ball may also be replaced by dilations of some other convex body, but in general the resulting densities are not equal.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1310672458 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.