Simplex based space filling designs

DOI10.1016/j.jspi.2009.08.002zbMath1177.62099OpenAlexW1978805193MaRDI QIDQ1044050

Thomas Muehlenstaedt

Publication date: 10 December 2009

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jspi.2009.08.002

zbMATH Keywords

triangulationcomputer experimentsuniform designmaximin design

Mathematics Subject Classification ID

Related Items (1)

Kernel interpolation

Uses Software

• Qhull

Cites Work

• Optimization by Simulated Annealing
• Exploratory designs for computational experiments
• On the complexity of d-dimensional Voronoi diagrams
• Finding maximin Latin hypercube designs by iterated local search heuristics
• Optimality of the Delaunay triangulation in \(\mathbb{R}^ d\)
• The design and analysis of computer experiments.
• Lower bounds for wrap-around \(L_2\)-discrepancy and constructions of symmetrical uniform designs
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• The quickhull algorithm for convex hulls
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Simplex based space filling designs