Simple random coverage models, well studied in Euclidean space, can also be defined on a general compact metric space. By analogy with the geometric and discrete coupon collector's problem cover times for finite Markov chains, one expects weak concentration bound distribution of time to hold under minimal assumptions. We give two such results, fixed-radius balls other sequentially arriving rand...