A method of constructing maximin distance designs
Abstract One attractive class of space-filling designs for computer experiments is that of maximin distance designs. Algorithmic search for such designs is commonly used but this method becomes ineffective for large problems. Theoretical construction of maximin distance designs is challenging; some results have been obtained recently, often by employing highly specialized techniques. This paper presents an easy-to-use method for constructing maximin distance designs. The method is versatile as it is applicable for any distance measure. Our basic idea is to construct large designs from small designs and the method is effective because the quality of large designs is guaranteed by that of small designs, as evaluated by the maximin distance criterion.