Densest packings of typical convex sets are not lattice-like (Q1894716)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Densest packings of typical convex sets are not lattice-like |
scientific article |
Statements
Densest packings of typical convex sets are not lattice-like (English)
0 references
1 August 1995
0 references
The packing density \(\delta(C)\) of a set \(C\) with finite positive Lebesgue measure is defined as the supremum of the densities of all packings of congruent copies of \(C\). The lattice-packing density \(\delta_L (C)\) of \(C\) is the supremum of the densities of all lattice packings of \(C\). The author proves: If \(P\) is a convex polygon which has no parallel sides, then \(\delta_L(P) < \delta (P)\). There is a pleasing discussion of related results (e.g., generalized Dirichlet cells, covering) and open problems.
0 references
density
0 references
lattice-packing
0 references
Dirichlet cells
0 references