Densest packings of typical convex sets are not lattice-like

DOI10.1007/BF02570693zbMath0829.52006OpenAlexW2140252779MaRDI QIDQ1894716

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

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

Related Items (2)

Finite packing and covering by congruent convex domains ⋮ Packing, covering and tiling in two-dimensional spaces

Cites Work

• Disks with special properties of densest packings
• Applications of random sampling to on-line algorithms in computational geometry
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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