2015
DOI: 10.1007/s11390-015-1535-0
|View full text |Cite
|
Sign up to set email alerts
|

A Survey of Blue-Noise Sampling and Its Applications

Abstract: 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 primitives and classify the sampling algorithms based on various aspects, e.g., the sampling domain and the type of algorithm. We demonstrate several well-known applications that can be improved by recent blue-noise sampling techniques, as well as some new applications such as dynamic sampling and blue-noise remeshing.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
2
1

Relationship

1
8

Authors

Journals

citations
Cited by 60 publications
(28 citation statements)
references
References 98 publications
(142 reference statements)
0
28
0
Order By: Relevance
“…Cook proposes Poisson‐disk sampling or jittering on a regular grid as two methods to generate such point sets [Coo86]. The majority of research on blue‐noise sampling deals with the generation of samples at suitable locations, and we refer to Yan et al [YGW∗15] for an extensive survey of sampling methods. The following methods are closely related to our research because they either subsample a given set of points or produce hierarchical representations of three‐dimensional point clouds by generating samples on a mesh.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Cook proposes Poisson‐disk sampling or jittering on a regular grid as two methods to generate such point sets [Coo86]. The majority of research on blue‐noise sampling deals with the generation of samples at suitable locations, and we refer to Yan et al [YGW∗15] for an extensive survey of sampling methods. The following methods are closely related to our research because they either subsample a given set of points or produce hierarchical representations of three‐dimensional point clouds by generating samples on a mesh.…”
Section: Related Workmentioning
confidence: 99%
“…The subsampling strategy used during the indexing step in section 4.2 is, with some limitations, exchangeable. We implemented and evaluated two approaches, a fast random sampling strategy with a certain level of uniformity as described by Kang et al [KJWX19], and an approximate Poisson‐disk sampling strategy [Coo86; YGW∗15] that enforces a minimum distance between points except between adjacent octree nodes. For each node, the input to the sampling method consists of points in its direct child nodes.…”
Section: Subsamplingmentioning
confidence: 99%
“…This representation resembles stippling [MARI17] and builds on the porosity definition by using the metaphor of clustered grains of rock to encode porosity. In this representation, the grains are represented as decals , and the variation of porosity on the reservoir is encoded by arranging decals on the surface using a sampling strategy based on Poisson sampling [CCS12, YGW*15]. It provides a good strategy to convey trends of the porosity distribution in a smooth way, i.e., there is a smooth transition across cell boundaries.…”
Section: Visualization Designmentioning
confidence: 99%
“…In this section, we only discuss a number of surface sampling algorithms. Extensive surveys of blue noise sampling techniques were presented by Lagae and Dutré [6] and Yan et al [14]. The classic dart-throwing algorithm was first generalized to mesh surfaces by Cline et al [15].…”
Section: Samplingmentioning
confidence: 99%