Relaxed disk packing

Edelsbrunner, E.; Iglesias-Ham, M.; Kurlin, V.; Kouhestani, Bahram; Rappaport, David

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.

Citation

Edelsbrunner, E., Iglesias-Ham, M., Kurlin, V., Kouhestani, B., & Rappaport, D. (2015, August). Relaxed disk packing. Presented at 27th Canadian Conference on Computational Geometry., Queen's University, Kingston, Ontario, Canada

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 27th Canadian Conference on Computational Geometry.
• Acceptance Date: Jun 19, 2015
• Publication Date: Aug 10, 2015
• Deposit Date: Sep 18, 2015
• Publicly Available Date: Oct 2, 2015
• Pages: 128-135
• Book Title: Proceedings of the 27th Canadian Conference on Computational Geometry, August 10-12, 2015, Queen’s University, Kingston, Ontario Canada.
• Keywords: Packing and covering, Disks, Lattices, Voronoi domains, Delaunay triangulations.
• Public URL: https://durham-repository.worktribe.com/output/1153561
• Publisher URL: http://research.cs.queensu.ca/cccg2015/
• Additional Information: Conference dates: August 10–12, 2015