TY - JOUR
AB - 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.
AU - Edelsbrunner, Herbert
AU - Iglesias Ham, Mabel
ID - 530
JF - Computational Geometry: Theory and Applications
TI - Multiple covers with balls I: Inclusionâ€“exclusion
VL - 68
ER -