A method for finding the densest lattice k-fold packing of disks

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)

zbMATH Keywords

densest latticed disk k-fold packing

Mathematics Subject Classification ID

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)

Packing, covering and tiling in two-dimensional spaces

Cites Work

• On the densest lattice 8-packing in the plane
• Mehrfache gitterförmige Kreislagerungen in der Ebene
• Multiple Packing of Circles in the Plane
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A method for finding the densest lattice k-fold packing of disks