摘要: This Letter presents algorithms for computing a uniform sequence of n integer points in given interval [0,m] where m and are integers such that m>n>0. The uniformity point set is measured by the ratio minimum gap over maximum gap. We prove we can insert integral one into while keeping at least 1/2. If require strictly greater than 1/2, does not always exist, but tight upper bound on length values m.
core.ac.uk
acm.org
elsevier.com
sci-hub.se 参考文章(2)
Bernard Chazelle, The Discrepancy Method: Randomness and Complexity ,(2000)
Sachio Teramoto, Tetsuo Asano, Naoki Katoh, Benjamin Doerr, Inserting Points Uniformly at Every Instance The IEICE transactions on information and systems. ,vol. 89, pp. 2348- 2356 ,(2006) , 10.1093/IETISY/E89-D.8.2348