Parallel blue-noise sampling by constrained farthest point optimization

Renjie Chen; Craig Gotsman

doi:10.1111/j.1467-8659.2012.03182.x

Parallel blue-noise sampling by constrained farthest point optimization

Renjie Chen, Craig Gotsman

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

We describe a fast sampling algorithm for generating uniformly-distributed point patterns with good blue noise characteristics. The method, based on constrained farthest point optimization, is provably optimal and may be easily parallelized, resulting in an algorithm whose performance/quality tradeoff is superior to other state-of-the-art approaches.

Original language	English (US)
Pages (from-to)	1775-1785
Number of pages	11
Journal	Computer Graphics Forum
Volume	31
Issue number	5
DOIs	https://doi.org/10.1111/j.1467-8659.2012.03182.x
State	Published - 2012
Externally published	Yes

All Science Journal Classification (ASJC) codes

Computer Graphics and Computer-Aided Design

Access to Document

10.1111/j.1467-8659.2012.03182.x

Cite this

@article{03ee9f1359d649388134998745d42ca3,

title = "Parallel blue-noise sampling by constrained farthest point optimization",

abstract = "We describe a fast sampling algorithm for generating uniformly-distributed point patterns with good blue noise characteristics. The method, based on constrained farthest point optimization, is provably optimal and may be easily parallelized, resulting in an algorithm whose performance/quality tradeoff is superior to other state-of-the-art approaches.",

author = "Renjie Chen and Craig Gotsman",

year = "2012",

doi = "10.1111/j.1467-8659.2012.03182.x",

language = "English (US)",

volume = "31",

pages = "1775--1785",

journal = "Computer Graphics Forum",

issn = "0167-7055",

publisher = "Wiley-Blackwell",

number = "5",

}

TY - JOUR

T1 - Parallel blue-noise sampling by constrained farthest point optimization

AU - Chen, Renjie

AU - Gotsman, Craig

PY - 2012

Y1 - 2012

N2 - We describe a fast sampling algorithm for generating uniformly-distributed point patterns with good blue noise characteristics. The method, based on constrained farthest point optimization, is provably optimal and may be easily parallelized, resulting in an algorithm whose performance/quality tradeoff is superior to other state-of-the-art approaches.

AB - We describe a fast sampling algorithm for generating uniformly-distributed point patterns with good blue noise characteristics. The method, based on constrained farthest point optimization, is provably optimal and may be easily parallelized, resulting in an algorithm whose performance/quality tradeoff is superior to other state-of-the-art approaches.

UR - http://www.scopus.com/inward/record.url?scp=84879801175&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84879801175&partnerID=8YFLogxK

U2 - 10.1111/j.1467-8659.2012.03182.x

DO - 10.1111/j.1467-8659.2012.03182.x

M3 - Article

AN - SCOPUS:84879801175

SN - 0167-7055

VL - 31

SP - 1775

EP - 1785

JO - Computer Graphics Forum

JF - Computer Graphics Forum

IS - 5

ER -

Parallel blue-noise sampling by constrained farthest point optimization

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this