Relaxed disk packing

H. Edelsbrunner, M. Iglesias Ham, V. Kurlin, in:, Proceedings of the 27th Canadian Conference on Computational Geometry, 2015, pp. 128–135.

Conference Paper | Published | English
Department
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.
Publishing Year
Date Published
2015-08-01
Proceedings Title
Proceedings of the 27th Canadian Conference on Computational Geometry
Page
128-135
Conference
CCCG: Canadian Conference on Computational Geometry
Conference Location
Ontario, Canada
Conference Date
2015-08-10 – 2015-08-12
IST-REx-ID

Cite this

Edelsbrunner H, Iglesias Ham M, Kurlin V. Relaxed disk packing. In: Proceedings of the 27th Canadian Conference on Computational Geometry. ; 2015:128-135.
Edelsbrunner, H., Iglesias Ham, M., & Kurlin, V. (2015). Relaxed disk packing. In Proceedings of the 27th Canadian Conference on Computational Geometry (pp. 128–135). Ontario, Canada.
Edelsbrunner, Herbert, Mabel Iglesias Ham, and Vitaliy Kurlin. “Relaxed Disk Packing.” In Proceedings of the 27th Canadian Conference on Computational Geometry, 128–35, 2015.
H. Edelsbrunner, M. Iglesias Ham, and V. Kurlin, “Relaxed disk packing,” in Proceedings of the 27th Canadian Conference on Computational Geometry, Ontario, Canada, 2015, pp. 128–135.
Edelsbrunner H, Iglesias Ham M, Kurlin V. 2015. Relaxed disk packing. Proceedings of the 27th Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry 128–135.
Edelsbrunner, Herbert, et al. “Relaxed Disk Packing.” Proceedings of the 27th Canadian Conference on Computational Geometry, 2015, pp. 128–35.

Link(s) to Main File(s)
Access Level
OA Open Access

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar