Densest packings of typical convex sets are not lattice-like

DOI10.1007/BF02570693MaRDI QIDQ1894716zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 1 August 1995

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/131389

zbMATH Keywords

densityDirichlet cellslattice-packing

Mathematics Subject Classification ID

Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 66687
• scientific article; zbMATH DE number 3868125
• Densest packing of translates of a domain
• scientific article; zbMATH DE number 3282420
• scientific article; zbMATH DE number 14304

Cites work

• Applications of random sampling to on-line algorithms in computational geometry
• Disks with special properties of densest packings
• scientific article; zbMATH DE number 3868125 (Why is no real title available?)
• scientific article; zbMATH DE number 3968590 (Why is no real title available?)
• scientific article; zbMATH DE number 480262 (Why is no real title available?)
• scientific article; zbMATH DE number 739016 (Why is no real title available?)
• scientific article; zbMATH DE number 3282420 (Why is no real title available?)
• scientific article; zbMATH DE number 3056572 (Why is no real title available?)

Cited in

(10)

• Densest packing of translates of a domain
• Finite packing and covering by congruent convex domains
• Densest translational lattice packing of non-convex polygons
• On the density of sets avoiding parallelohedron distance 1
• Random lattices and random sphere packings: Typical properties
• scientific article; zbMATH DE number 3915117 (Why is no real title available?)
• scientific article; zbMATH DE number 14304 (Why is no real title available?)
• scientific article; zbMATH DE number 66687 (Why is no real title available?)
• Packing, covering and tiling in two-dimensional spaces
• How to build a barricade

This page was built for publication: Densest packings of typical convex sets are not lattice-like

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894716)