{"language":[{"iso":"eng"}],"type":"conference","_id":"1495","citation":{"ieee":"H. Edelsbrunner, M. Iglesias Ham, and V. Kurlin, “Relaxed disk packing,” in <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>, Ontario, Canada, 2015, vol. 2015–August, pp. 128–135.","ista":"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 vol. 2015–August, 128–135.","ama":"Edelsbrunner H, Iglesias Ham M, Kurlin V. Relaxed disk packing. In: <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>. Vol 2015-August. Queen’s University; 2015:128-135.","mla":"Edelsbrunner, Herbert, et al. “Relaxed Disk Packing.” <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>, vol. 2015–August, Queen’s University, 2015, pp. 128–35.","short":"H. Edelsbrunner, M. Iglesias Ham, V. Kurlin, in:, Proceedings of the 27th Canadian Conference on Computational Geometry, Queen’s University, 2015, pp. 128–135.","apa":"Edelsbrunner, H., Iglesias Ham, M., &#38; Kurlin, V. (2015). Relaxed disk packing. In <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i> (Vol. 2015–August, pp. 128–135). Ontario, Canada: Queen’s University.","chicago":"Edelsbrunner, Herbert, Mabel Iglesias Ham, and Vitaliy Kurlin. “Relaxed Disk Packing.” In <i>Proceedings of the 27th Canadian Conference on Computational Geometry</i>, 2015–August:128–35. Queen’s University, 2015."},"publist_id":"5684","author":[{"first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","first_name":"Mabel","full_name":"Iglesias Ham, Mabel","last_name":"Iglesias Ham"},{"first_name":"Vitaliy","last_name":"Kurlin","full_name":"Kurlin, Vitaliy"}],"abstract":[{"lang":"eng","text":"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. "}],"date_published":"2015-08-01T00:00:00Z","project":[{"name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"318493"}],"oa_version":"Submitted Version","year":"2015","volume":"2015-August","quality_controlled":"1","status":"public","page":"128-135","publication_status":"published","day":"01","main_file_link":[{"url":"https://arxiv.org/abs/1505.03402","open_access":"1"}],"department":[{"_id":"HeEd"}],"month":"08","date_updated":"2021-01-12T06:51:09Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication":"Proceedings of the 27th Canadian Conference on Computational Geometry","publisher":"Queen's University","title":"Relaxed disk packing","date_created":"2018-12-11T11:52:21Z","oa":1,"ec_funded":1,"scopus_import":1,"conference":{"location":"Ontario, Canada","start_date":"2015-08-10","end_date":"2015-08-12","name":"CCCG: Canadian Conference on Computational Geometry"}}