k-d Darts: Sampling by k-Dimensional Flat Searches
Mohamed S. Ebeida, Anjul Patney, Scott A. Mitchell, Keith R. Dalbey,, Andrew A. Davidson, and John D. Owens

TL;DR
This paper introduces k-d darts, a sampling method using k-dimensional flats, which improves efficiency over point sampling in high-dimensional functions, with applications in Poisson-disk sampling, depth-of-field rendering, and volume estimation.
Contribution
It formalizes k-d darts for function sampling, providing a conversion recipe from point sampling and demonstrating efficiency gains in high-dimensional applications.
Findings
k-d darts outperform point sampling in high dimensions for certain tasks
Line darts enable faster Poisson-disk sampling with less memory
Higher-dimensional darts improve volume estimation accuracy
Abstract
We formalize the notion of sampling a function using k-d darts. A k-d dart is a set of independent, mutually orthogonal, k-dimensional subspaces called k-d flats. Each dart has d choose k flats, aligned with the coordinate axes for efficiency. We show that k-d darts are useful for exploring a function's properties, such as estimating its integral, or finding an exemplar above a threshold. We describe a recipe for converting an algorithm from point sampling to k-d dart sampling, assuming the function can be evaluated along a k-d flat. We demonstrate that k-d darts are more efficient than point-wise samples in high dimensions, depending on the characteristics of the sampling domain: e.g. the subregion of interest has small volume and evaluating the function along a flat is not too expensive. We present three concrete applications using line darts (1-d darts): relaxed maximal…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
