Given a finite point set Z ⊂ R, the covering radius of a nonempty subset X ⊂ Z is the minimum distance rX,Z such that every point in Z is at a distance of at most rX,Z from some point in X. This paper concerns the construction of a sequence of subsets of decreasing sizes, such that their covering radii are small. To this end, a method for progressive data reduction, referred to as scattered dat...