A method for finding the densest lattice k-fold packing of disks
From MaRDI portal
Publication:1096185
DOI10.1007/BF01159857zbMath0633.52012MaRDI QIDQ1096185
N. N. Yakovlev, Jenő Horváth, Agota H. Temesvári
Publication date: 1987
Published in: Mathematical Notes (Search for Journal in Brave)
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)
Related Items (1)
Cites Work
This page was built for publication: A method for finding the densest lattice k-fold packing of disks