Analysis and Synthesis of Digital Dyadic Sequences
Abstract
We explore the space of matrix-generated (0, m, 2)-nets and (0, 2)-sequences in base 2, also known as digital dyadic nets and sequences. In computer graphics, they are arguably leading the competition for use in rendering. We provide a complete characterization of the design space and count the possible number of constructions with and without considering possible reorderings of the point set. Based on this analysis, we then show that every digital dyadic net can be reordered into a sequence, together with a corresponding algorithm. Finally, we present a novel family of self-similar digital dyadic sequences, to be named -sequences, that spans a subspace with fewer degrees of freedom. Those -sequences are extremely efficient to sample and compute, and we demonstrate their advantages over the classic Sobol (0, 2)-sequence.
Keywords
Cite
@article{arxiv.2306.06925,
title = {Analysis and Synthesis of Digital Dyadic Sequences},
author = {Abdalla G. M. Ahmed and Mikhail Skopenkov and Markus Hadwiger and Peter Wonka},
journal= {arXiv preprint arXiv:2306.06925},
year = {2025}
}
Comments
17 pages, 11 figures. Minor improvement of exposition; references to earlier proofs of Theorems 3.1 and 3.3 added