### Abstract

We investigate minimax Latin hypercube designs in two dimensions for several distance measures.For the l-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 l1-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 l2-distance we have generated minimax solutions up to n = 27 by an exhaustive search method.The latter Latin hypercube designs will be included in the website www.spacefillingdesigns.nl.

Original language | English |
---|---|

Place of Publication | Tilburg |

Publisher | Operations research |

Number of pages | 13 |

Volume | 2005-105 |

Publication status | Published - 2005 |

### Publication series

Name | CentER Discussion Paper |
---|---|

Volume | 2005-105 |

### Keywords

- minimax
- Latin hypercube designs
- circle coverings

## Fingerprint Dive into the research topics of 'Two-Dimensional Minimax Latin Hypercube Designs'. Together they form a unique fingerprint.

## Cite this

van Dam, E. R. (2005).

*Two-Dimensional Minimax Latin Hypercube Designs*. (CentER Discussion Paper; Vol. 2005-105). Operations research.