We present a fast, scalable algorithm to generate high-quality blue noise point distributions
of arbitrary density functions. At its core is a novel formulation of the recently-introduced …

In this paper we describe sample elimination for generating Poisson disk sample sets with a
desired size. We introduce a greedy sample elimination algorithm that assigns a weight to …

Generalized barycentric coordinates such as Wachspress and mean value coordinates have
been used in polygonal and polyhedral finite element methods. Recently, mimetic finite …

In this work we present a new algorithm for accelerating the colour bilateral filter based on a
subsampling strategy working in the spatial domain. The base idea is to use a suitable …

We provide a simple algorithm and data structures for d‐dimensional unbiased maximal
Poisson‐disk sampling. We use an order of magnitude less memory and time than the …

In this article we survey techniques for the digital simulation of hand-made stippling—one of
the core techniques developed within non-photorealistic/expressive rendering. Over the …

In this paper, we survey recent approaches to blue-noise sampling and discuss their
beneficial applications. We discuss the sampling algorithms that use points as sampling …

In this paper, we present the development of quadratic serendipity shape functions on
planar convex and nonconvex polygons. Drawing on the work of Bompadre et al.(2012)[1] …

In this article, we study the generation of maximal Poisson-disk sets with varying radii. First,
we present a geometric analysis of gaps in such disk sets. This analysis is the basis for …

Abstract Quasi‐Monte Carlo (QMC) methods exhibit a faster convergence rate than that of
classic Monte Carlo methods. This feature has made QMC prevalent in image synthesis …