Space-Filling in High-Dimensional Sets

[1]  Luc Pronzato,et al.  Design of computer experiments: space filling and beyond , 2011, Statistics and Computing.

[2]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[3]  Martin N. Huxley,et al.  On the distribution of Farey fractions and hyperbolic lattice points , 2001, Period. Math. Hung..

[4]  Luc Pronzato,et al.  Measures Minimizing Regularized Dispersion , 2018, Journal of Scientific Computing.

[5]  Gillis Pagés,et al.  A space quantization method for numerical integration , 1998 .

[6]  V. V. Petrov.  Limit Theorems of Probability Theory: Sequences of Independent Random Variables , 1995 .

[7]  G. Tóth,et al.  Packing and Covering with Convex Sets , 1993 .

[8]  N. J. A. Sloane,et al.  Sphere Packings, Lattices and Groups , 1987, Grundlehren der mathematischen Wissenschaften.

[9]  G. Larcher,et al.  Weighted Discrepancy and High-Dimensional Numerical Integration , 2003 .

[10]  K. Ball.  An Elementary Introduction to Modern Convex Geometry , 1997 .

[11]  A. Zhigljavsky,et al.  Non-lattice Covering and Quantization of High Dimensional Sets , 2020, 2006.02705.

[12]  J. Franel,et al.  Les suites de Farey et le problème des nombres premiers , 1924 .

[13]  M. E. Johnson,et al.  Minimax and maximin distance designs , 1990 .

[14]  Robert F. Tichy,et al.  Sequences, Discrepancies and Applications , 1997 .

[15]  F. Dress.  Discrépance des suites de Farey , 1999 .

[16]  N. J. A. Sloane,et al.  Voronoi regions of lattices, second moments of polytopes, and quantization , 1982, IEEE Trans. Inf. Theory.

[17]  Paul Deheuvels,et al.  Strong bounds for multidimensional spacings , 1983 .

[18]  A. G. Sukharev.  Optimal strategies of the search for an extremum , 1971 .

[19]  Fred J. Hickernell,et al.  A generalized discrepancy and quadrature error bound , 1998, Math. Comput..

[20]  A. Zhigljavsky,et al.  Asymptotic Distribution of the Distance Function to the Farey Points , 1997 .

[21]  A. Zhigljavsky,et al.  Covering of High-Dimensional Cubes and Quantization , 2020, SN Operations Research Forum.

[22]  Avrim Blum,et al.  Foundations of Data Science , 2020 .

[23]  Qiang Du,et al.  Centroidal Voronoi Tessellations: Applications and Algorithms , 1999, SIAM Rev..

[24]  Svante Janson,et al.  Maximal spacings in several dimensions , 1987 .

[25]  S. Kanemitsu,et al.  Farey series and the Riemann hypothesis , 1996 .

[26]  Luc Pronzato,et al.  Bayesian Quadrature, Energy Minimization, and Space-Filling Design , 2020, SIAM/ASA J. Uncertain. Quantification.

[27]  Gunzburger,et al.  Advances in Studies and Applications of Centroidal Voronoi Tessellations , 2010 .

[28]  Antanas Zilinskas.  On the worst-case optimal multi-objective global optimization , 2013, Optim. Lett..

[29]  Vladimir N. Temlyakov,et al.  Cubature formulas, discrepancy, and nonlinear approximation , 2003, J. Complex..

[30]  E. Saff,et al.  Distributing many points on a sphere , 1997 .

[31]  Alvise Sommariva,et al.  Computing Multivariate Fekete and Leja Points by Numerical Linear Algebra , 2010, SIAM J. Numer. Anal..

[32]  N. J. A. Sloane,et al.  Fast quantizing and decoding and algorithms for lattice quantizers and codes , 1982, IEEE Trans. Inf. Theory.