
The algorithm to compute packings can be modified to get coverings. Assume, we have an interval such that . In this case, the spheres with centers in
and radius r are covering all and the spheres of radius are covering the whole space . The density of the covering is
Remark.
This proposition
implies that in order to get a good covering,
the parameters r and have to be chosen in such a way that
is as homogeneous as possible.
The computations for coverings are more involved as the computations for
packings since the determination of the set
includes a timeconsuming
sorting.