Packing density

From Wikipedia, the free encyclopedia
  (Redirected from Packing fraction)
Jump to: navigation, search

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 packing problems, the objective is usually to obtain a packing of the greatest possible density.

In compact spaces[edit]

If K1,…,Kn are measurable subsets of a compact measure space X and their interiors pairwise do not intersect, then the collection {Ki} is a packing in X and its packing density is

\eta = \frac{\sum_{i=1}^{n}\mu(K_i)}{\mu(X)}.

In Euclidean space[edit]

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 Bt is the ball of radius t centered at the origin, then the density of a packing {Ki : i∈ℕ} is

\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 μ(KiBt) can be replaced by μ(Ki) for every element that intersects Bt.[1] 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[edit]

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.[1]

A particular supply collection of interest is all Euclidean motions of a fixed convex body K. In this case, we call the packing constant the packing constant of 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[edit]

References[edit]

  1. ^ a b Groemer, H. (1986), "Some basic properties of packing and covering constants", Discrete and Computational Geometry 1: 183, doi:10.1007/BF02187693 

External links[edit]