Sphere Packing with Limited Overlap
Computational Geometry
2014-01-03 v1
Abstract
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of overlap with other balls. We study two natural choices of overlap measures and obtain the optimal lattice packings in a parameterized family of lattices which contains the FCC, BCC, and integer lattice.
Keywords
Cite
@article{arxiv.1401.0468,
title = {Sphere Packing with Limited Overlap},
author = {Mabel Iglesias-Ham and Michael Kerber and Caroline Uhler},
journal= {arXiv preprint arXiv:1401.0468},
year = {2014}
}
Comments
12 pages, 3 figures, submitted to SOCG 2014