Blue Noise through Optimal Transport - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Graphics Année : 2012

Blue Noise through Optimal Transport

Résumé

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.
Fichier principal
Vignette du fichier
Liris-5889.pdf (16.54 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01353135 , version 1 (07-03-2017)

Identifiants

Citer

Fernando de Goes, Katherine Breeden, Victor Ostromoukhov, Mathieu Desbrun. Blue Noise through Optimal Transport. ACM Transactions on Graphics, 2012, 6, 31, pp.171:1-171:1. ⟨10.1145/2366145.2366190⟩. ⟨hal-01353135⟩
400 Consultations
359 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More