Journal
DISCRETE APPLIED MATHEMATICS
Volume 156, Issue 18, Pages 3483-3493Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.dam.2008.02.009
Keywords
Minimax designs; Latin hypercube designs; Circle coverings
Categories
Funding
- Royal Netherlands Academy of Arts and Sciences
Ask authors/readers for more resources
We investigate minimax Latin hypercuber designs in two dimensions for several distance measures. For the l(infinity)-distance we are able to construct minimax Latin hypercube designs of n points, and to determine the minimal covering radius, for all n. For the l(1)-distance we have a lower bound for the covering radius, and a construction of minimax Latin hypercube designs for (infinitely) many values of n. We conjecture that the obtained lower bound is attained, except for a few small (known) values of n. For the l(2)-distance we have generated minimax solutions up to n = 27 by an exhaustive search method. The latter Latin hypercube designs are included in the website www.spacefillingdesigns.nl. (C) 2008 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available