A Simple Push-Pull Algorithm for Blue-Noise Sampling

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&#...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 23(2017), 12 vom: 28. Dez., Seite 2496-2508
1. Verfasser: Ahmed, Abdalla G M (VerfasserIn)
Weitere Verfasser: Guo, Jianwei, Yan, Dong-Ming, Franceschia, Jean-Yves, Zhang, Xiaopeng, Deussen, Oliver
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2017
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article Research Support, Non-U.S. Gov't
LEADER 01000naa a22002652 4500
001 NLM26752577X
003 DE-627
005 20231224220854.0
007 cr uuu---uuuuu
008 231224s2017 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2016.2641963  |2 doi 
028 5 2 |a pubmed24n0891.xml 
035 |a (DE-627)NLM26752577X 
035 |a (NLM)28029623 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Ahmed, Abdalla G M  |e verfasserin  |4 aut 
245 1 2 |a A Simple Push-Pull Algorithm for Blue-Noise Sampling 
264 1 |c 2017 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 17.12.2018 
500 |a Date Revised 17.12.2018 
500 |a published: Print-Electronic 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a 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 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Guo, Jianwei  |e verfasserin  |4 aut 
700 1 |a Yan, Dong-Ming  |e verfasserin  |4 aut 
700 1 |a Franceschia, Jean-Yves  |e verfasserin  |4 aut 
700 1 |a Zhang, Xiaopeng  |e verfasserin  |4 aut 
700 1 |a Deussen, Oliver  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 23(2017), 12 vom: 28. Dez., Seite 2496-2508  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:23  |g year:2017  |g number:12  |g day:28  |g month:12  |g pages:2496-2508 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2016.2641963  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 23  |j 2017  |e 12  |b 28  |c 12  |h 2496-2508