The study of finite approximations of probability measures has a long history. In (Xu and Berger, 2017), the authors focus on constrained finite approximations and, in particular, uniform ones in dimension d = 1. The present paper gives an elementary construction of a uniform decomposition of probability measures in dimension d ≥ 1. This decomposition is then used to give upper-bounds on the rate of convergence of the optimal uniform approximation error. These bounds appear to be the generalization of the ones obtained in (Xu and Berger, 2017) and to be sharp for generic probability measures.