A simple push-pull algorithm for blue-noise sampling

43Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We describe a simple push-pull optimization (PPO) algorithm for blue-noise sampling by enforcing spatial constraints on given point sets. Constraints can be a minimum distance between samples, a maximum distance between an arbitrary point and the nearest sample, and a maximum deviation of a sample's capacity (area of Voronoi cell) from the mean capacity. All of these constraints are based on the topology emerging from Delaunay triangulation, and they can be combined for improved sampling quality and efficiency. In addition, our algorithm offers flexibility for trading-off between different targets, such as noise and aliasing. We present several applications of the proposed algorithm, including anti-aliasing, stippling, and non-obtuse remeshing. Our experimental results illustrate the efficiency and the robustness of the proposed approach. Moreover, we demonstrate that our remeshing quality is superior to the current state-of-the-art approaches.

Cite

CITATION STYLE

APA

Ahmed, A. G. M., Guo, J., Yan, D. M., Franceschia, J. Y., Zhang, X., & Deussen, O. (2017). A simple push-pull algorithm for blue-noise sampling. IEEE Transactions on Visualization and Computer Graphics, 23(12), 2496–2508. https://doi.org/10.1109/TVCG.2016.2641963

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free