# Latin Hypercubes and Space-filling Designs

arXiv: https://arxiv.org/abs/2203.06334 · HTML: https://mlsanity.com/paper/2203.06334/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 12 Mar 2022.

## Built on by (most cited first, 4 of 4)

- [Learning from Hypervectors: A Survey on Hypervector Encoding](https://mlsanity.com/paper/2308.00685/) (2023)
- [Active Learning of Piecewise Gaussian Process Surrogates](https://mlsanity.com/paper/2301.08789/) (2023)
- [Voronoi Candidates for Bayesian Optimization](https://mlsanity.com/paper/2402.04922/) (2024)
- [Scenario Discovery for Urban Planning: The Case of Green Urbanism and the Impact on Stress](https://mlsanity.com/paper/2504.02905/) (2025)

## 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.