Spoke Darts for Efficient High Dimensional Blue Noise Sampling

08/05/2014
by   Mohamed S. Ebeida, et al.
0

Blue noise refers to sample distributions that are random and well-spaced, with a variety of applications in graphics, geometry, and optimization. However, prior blue noise sampling algorithms typically suffer from the curse-of-dimensionality, especially when striving to cover a domain maximally. This hampers their applicability for high dimensional domains. We present a blue noise sampling method that can achieve high quality and performance across different dimensions. Our key idea is spoke-dart sampling, sampling locally from hyper-annuli centered at prior point samples, using lines, planes, or, more generally, hyperplanes. Spoke-dart sampling is more efficient at high dimensions than the state-of-the-art alternatives: global sampling and advancing front point sampling. Spoke-dart sampling achieves good quality as measured by differential domain spectrum and spatial coverage. In particular, it probabilistically guarantees that each coverage gap is small, whereas global sampling can only guarantee that the sum of gaps is not large. We demonstrate advantages of our method through empirical analysis and applications across dimensions 8 to 23 in Delaunay graphs, global optimization, and motion planning.

READ FULL TEXT

page 2

page 8

research
06/15/2022

Gaussian Blue Noise

Among the various approaches for producing point distributions with blue...
research
07/14/2020

Estimating Barycenters of Measures in High Dimensions

Barycentric averaging is a principled way of summarizing populations of ...
research
05/09/2022

Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions

We interleave sampling based motion planning methods with pruning ideas ...
research
02/16/2013

k-d Darts: Sampling by k-Dimensional Flat Searches

We formalize the notion of sampling a function using k-d darts. A k-d da...
research
06/18/2018

End-to-end Sampling Patterns

Sample patterns have many uses in Computer Graphics, ranging from proced...
research
02/14/2020

Covering of high-dimensional cubes and quantization

As the main problem, we consider covering of a d-dimensional cube by n b...

Please sign up or login with your details

Forgot password? Click here to reset