Fast Fourier transforms for nonequispaced data
SIAM Journal on Scientific Computing
NPAR '02 Proceedings of the 2nd international symposium on Non-photorealistic animation and rendering
Foundations of Quantization for Probability Distributions
Foundations of Quantization for Probability Distributions
Capacity-constrained point distributions: a variant of Lloyd's method
ACM SIGGRAPH 2009 papers
Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
ACM Transactions on Mathematical Software (TOMS)
A variational characterisation of spherical designs
Journal of Approximation Theory
Dithering by Differences of Convex Functions
SIAM Journal on Imaging Sciences
Hi-index | 0.00 |
The stippling technique places black dots such that their density gives the impression of tone. This is the first paper that relates the distribution of stippling dots to the classical mathematical question of finding 'optimal' nodes for quadrature rules. More precisely, we consider quadrature error functionals on reproducing kernel Hilbert spaces (RKHSs) with respect to the quadrature nodes and suggest to use optimal distributions of these nodes as stippling dot positions. Interestingly, in special cases, our quadrature errors coincide with discrepancy functionals and with recently proposed attraction-repulsion functionals. Our framework enables us to consider point distributions not only in ℝ2 but also on the torus $\ensuremath{\mathbb{T}}^2$ and the sphere ${\mathbb{S}}^2$ . For a large number of dots the computation of their distribution is a serious challenge and requires fast algorithms. To this end, we work in RKHSs of bandlimited functions, where the quadrature error can be replaced by a least squares functional. We apply a nonlinear conjugate gradient (CG) method on manifolds to compute a minimizer of this functional and show that each step can be efficiently realized by nonequispaced fast Fourier transforms. We present numerical stippling results on ${\mathbb{S}}^2$ .