We address the problem of covering ℝn with congruent balls, while minimizing the number of balls that contain an average point. Considering the 1-parameter family of lattices defined by stretching or compressing the integer grid in diagonal direction, we give a closed formula for the covering density that depends on the distortion parameter. We observe that our family contains the thinnest lattice coverings in dimensions 2 to 5. We also consider the problem of packing congruent balls in ℝn , for which we give a closed formula for the packing density as well. Again we observe that our family contains optimal configurations, this time densest packings in dimensions 2 and 3. © 2011 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Edelsbrunner, H., & Kerber, M. (2011). Covering and packing with spheres by diagonal distortion in ℝn. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 6570, 20–35. https://doi.org/10.1007/978-3-642-19391-0_2
Mendeley helps you to discover research relevant for your work.