Latin Hypercubes and Space-filling Designs
Not on the map. Why?
Abstract (arXiv)
This chapter discusses a general design approach to planning computer experiments, which seeks design points that fill a bounded design region as uniformly as possible. Such designs are broadly referred to as space-filling designs.
Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). First posted on arXiv 12 Mar 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 1.
4 papers.
- 2023Learning from Hypervectors: A Survey on Hypervector Encodingcited by 7
- 2023Active Learning of Piecewise Gaussian Process Surrogatescited by 5
- 2024Voronoi Candidates for Bayesian Optimizationcited by 5
- 2025Scenario Discovery for Urban Planning: The Case of Green Urbanism and the Impact on Stresscited by 0
- 2025Scenario Discovery for Urban Planning: The Case of Green Urbanism and the Impact on Stress3 Apr 2025
- 2024Voronoi Candidates for Bayesian Optimization7 Feb 2024
- 2023Learning from Hypervectors: A Survey on Hypervector Encoding1 Aug 2023
- 2023Active Learning of Piecewise Gaussian Process Surrogates20 Jan 2023