--- res: bibo_abstract: - Inclusion–exclusion is an effective method for computing the volume of a union of measurable sets. We extend it to multiple coverings, proving short inclusion–exclusion formulas for the subset of Rn covered by at least k balls in a finite set. We implement two of the formulas in dimension n=3 and report on results obtained with our software.@eng bibo_authorlist: - foaf_Person: foaf_givenName: Herbert foaf_name: Edelsbrunner, Herbert foaf_surname: Edelsbrunner foaf_workInfoHomepage: http://www.librecat.org/personId=3FB178DA-F248-11E8-B48F-1D18A9856A87 orcid: 0000-0002-9823-6833 - foaf_Person: foaf_givenName: Mabel foaf_name: Iglesias Ham, Mabel foaf_surname: Iglesias Ham foaf_workInfoHomepage: http://www.librecat.org/personId=41B58C0C-F248-11E8-B48F-1D18A9856A87 bibo_doi: 10.1016/j.comgeo.2017.06.014 bibo_volume: 68 dct_date: 2018^xs_gYear dct_identifier: - UT:000415778300010 dct_language: eng dct_publisher: Elsevier@ dct_title: 'Multiple covers with balls I: Inclusion–exclusion@' ...