Article ID Journal Published Year Pages File Type
6868481 Computational Geometry 2018 15 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Multiple covers with balls I: Inclusion-exclusion
Authors
, ,