Fast adaptive blue noise on polygonal surfaces

Esdras Medeiros, Lis Ingrid, Sinésio Pesco, Claudio Silva

Research output: Contribution to journalArticlepeer-review


This paper proposes a novel method for the computation of hierarchical Poisson disk samplings on polygonal surfaces. The algorithm generates a pointerless hierarchical structure such that each level is a uniform Poisson disk sampling and a subset of the next level. As the main result, given a dynamically-varying importance sampling function defined over a surface, the hierarchy is capable of generating adaptive samplings with blue noise characteristics, temporal-coherence and real-time computation. Classical algorithms produce hierarchies in tight ratios, which is a serious bottleneck specially for a large number of samples. Instead, our method uses sparse ratios and decreases the adaptation error of the hierarchy through a fast optimization process. Therefore, we save a considerable amount of time (up to 74% in our experiments) while preserving the good blue noise properties. We present applications on Non-Photo Realistic rendering (NPR), more specifically, on surface stippling effects. First, we apply our method by taking illumination to be the importance sampling to shade the surface, and second, we dynamically deform a surface with a predefined stippled texture.

Original languageEnglish (US)
Pages (from-to)17-29
Number of pages13
JournalGraphical Models
Issue number1
StatePublished - 2014


  • Adaptation
  • Hierarchy
  • Importance sampling
  • Poisson disk sampling

ASJC Scopus subject areas

  • Software
  • Modeling and Simulation
  • Geometry and Topology
  • Computer Graphics and Computer-Aided Design


Dive into the research topics of 'Fast adaptive blue noise on polygonal surfaces'. Together they form a unique fingerprint.

Cite this