Variable Radii Poisson - Disk Sampling extended version
نویسندگان
چکیده
We introduce three natural and well-defined generalizations of maximal Poisson-disk sampling. The first is to decouple the disk-free (inhibition) radius from the maximality (coverage) radius. Selecting a smaller inhibition radius than the coverage radius yields samples which mix advantages of Poisson-disk and uniform-random samplings. The second generalization yields hierarchical samplings, by scaling inhibition and coverage radii by an abstract parameter, e.g. time. The third generalization is to allow the radii to vary spatially, according to a formally characterized sizing function. We state bounds on edge lengths and angles in a Delaunay triangulation of the points, dependent on the ratio of inhibition to coverage radii, or the sizing function’s Lipschitz constant. Hierarchical samplings have distributions similar to those created directly. 1 Maximal Poisson-disk Sampling A sampling is a set of ordered points taken from a domain at random. Each point is the center of a disk that precludes additional points inside it, but points are otherwise chosen uniformly. The sampling is maximal if the entire domain is covered by disks. Together these define maximal Poisson-disk sampling (MPS), a.k.a. the limit distribution of the Matérn second process [18]. More formally, a sampling X = (xi) n i=1, xi ∈ Ω satisfies the inhibition or empty disk property if ∀i < j ≤ n, |xi − xj | ≥ r. (1) The set of uncovered points is defined to be S(X) = {y ∈ Ω : |y− xi| ≥ r, i = 1..n}. (2) A sampling X is maximal if S(X) is empty:
منابع مشابه
Variable Radii Poisson Disk Sampling
We introduce three natural and well-defined generalizations of maximal Poisson-disk sampling. The first is to decouple the disk-free (inhibition) radius from the maximality (coverage) radius. Selecting a smaller inhibition radius than the coverage radius yields samples which mix advantages of Poisson-disk and uniform-random samplings. The second generalization yields hierarchical samplings, by ...
متن کاملA Comparison of Methods for Generating Poisson Disk Distributions
Abstract Poisson disk distributions have many applications in the field of computer graphics. Besides sampling, Poisson disk distributions are used in object distribution, non-photorealistic rendering and procedural texturing. Over the years, a large number of methods for generating Poisson disk distributions have been proposed, making it difficult to choose the right method for a given applica...
متن کاملEuclidean Traveling Salesman Tours through Stochastic Neighborhoods
Abstract. We consider the problem of planning a shortest tour through a collection of neighborhoods in the plane, where each neighborhood is a disk whose radius is an i.i.d. random variable drawn from a known probability distribution. This is a stochastic version of the classic traveling salesman problem with neighborhoods (TSPN). Planning such tours under uncertainty, a fundamental problem in ...
متن کاملEfficient Generation of Poisson-Disk Sampling Patterns
Poisson Disk sampling patterns are of interest to the graphics community because their blue-noise properties are desirable in sampling patterns for rendering, illumination, and other computations. Until now, such patterns could only be generated by slow methods with poor convergence, or could only be approximated by jittering individual samples or tiling sets of samples. We present a simple and...
متن کاملSample Elimination for Generating Poisson Disk Sample Sets
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 each sample in a given set and eliminates the ones with greater weights in order to pick a subset of a desired size with Poisson disk property without having to specify a Poisson disk radius. This new algorithm is s...
متن کامل