Abstract
We explore the space of (0,
m
, 2)-nets in base 2 commonly used for sampling. We present a novel constructive algorithm that can exhaustively generate all nets --- up to
m
-bit resolution --- and thereby compute the exact number of distinct nets. We observe that the construction algorithm holds the key to defining a transformation operation that lets us transform one valid net into another one. This enables the optimization of digital nets using arbitrary objective functions. For example, we define an analytic energy function for blue noise, and use it to generate nets with high-quality blue-noise frequency power spectra. We also show that the space of (0, 2)-sequences is significantly smaller than nets with the same number of points, which drastically limits the optimizability of sequences.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Example-Based Sampling with Diffusion Models;SIGGRAPH Asia 2023 Conference Papers;2023-12-10
2. Curl Noise Jittering;SIGGRAPH Asia 2023 Conference Papers;2023-12-10
3. Analysis and Synthesis of Digital Dyadic Sequences;ACM Transactions on Graphics;2023-12-05
4. ART-Owen Scrambling;ACM Transactions on Graphics;2023-12-05
5. Scalable Multi-Class Sampling via Filtered Sliced Optimal Transport;ACM Transactions on Graphics;2022-11-30