Relaxed Disk Packing
Computational Geometry
2015-05-14 v1
Abstract
Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the regular hexagonal grid gives the maximum among lattice configurations.
Cite
@article{arxiv.1505.03402,
title = {Relaxed Disk Packing},
author = {Herbert Edelsbrunner and Mabel Iglesias-Ham and Vitaliy Kurlin},
journal= {arXiv preprint arXiv:1505.03402},
year = {2015}
}
Comments
8 pages => 5 pages of main text plus 3 pages in appendix. Submitted to CCCG 2015