Revisiting the hexagonal lattice: on optimal lattice circle packing
From MaRDI portal
Publication:633466
DOI10.4171/EM/163zbMath1218.52016arXiv0911.4106MaRDI QIDQ633466
Publication date: 1 April 2011
Published in: Elemente der Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.4106
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 (7)
On arithmetic lattices in the plane ⋮ On lattice extensions ⋮ On the geometry of nearly orthogonal lattices ⋮ Long shortest vectors in low dimensional lattices ⋮ On well-rounded sublattices of the hexagonal lattice ⋮ On integral well-rounded lattices in the plane ⋮ On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
Cites Work
- Frobenius problem and the covering radius of a lattice
- On distribution of well-rounded sublattices of \(\mathbb Z^2\)
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
- Minkowski’s conjecture, well-rounded lattices and topological dimension
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Revisiting the hexagonal lattice: on optimal lattice circle packing
