Blue Noise through Optimal Transport

Abstract : We present a fast, scalable algorithm to generate high-quality blue noise point distributions of arbitrary density functions. At its core is a novel formulation of the recently-introduced concept of capacity-constrained Voronoi tessellation as an optimal transport problem. This insight leads to a continuous formulation able to enforce the capacity constraints exactly, unlike previous work. We exploit the variational nature of this formulation to design an efficient optimization technique of point distributions via constrained minimization in the space of power diagrams. Our mathematical, algorithmic, and practical contributions lead to high-quality blue noise point sets with improved spectral and spatial properties.
Document type :
Journal articles
Complete list of metadatas

Cited literature [35 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01353135
Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Tuesday, March 7, 2017 - 11:21:28 AM
Last modification on : Thursday, November 1, 2018 - 1:19:41 AM
Long-term archiving on : Thursday, June 8, 2017 - 1:14:33 PM

File

Liris-5889.pdf
Files produced by the author(s)

Identifiers

Citation

Fernando de Goes, Katherine Breeden, Victor Ostromoukhov, Mathieu Desbrun. Blue Noise through Optimal Transport. ACM Transactions on Graphics, Association for Computing Machinery, 2012, 6, 31, pp.171:1-171:1. ⟨10.1145/2366145.2366190⟩. ⟨hal-01353135⟩

Share

Metrics

Record views

409

Files downloads

362