{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T08:20:11Z","timestamp":1774686011033,"version":"3.50.1"},"reference-count":48,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T00:00:00Z","timestamp":1701734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2023,12,5]]},"abstract":"<jats:p>\n            We explore the space of matrix-generated (0,\n            <jats:italic toggle=\"yes\">m<\/jats:italic>\n            , 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\n            <jats:italic toggle=\"yes\">\u03be<\/jats:italic>\n            -sequences, that spans a subspace with fewer degrees of freedom. Those\n            <jats:italic toggle=\"yes\">\u03be<\/jats:italic>\n            -sequences are extremely efficient to sample and compute, and we demonstrate their advantages over the classic Sobol (0, 2)-sequence.\n          <\/jats:p>","DOI":"10.1145\/3618308","type":"journal-article","created":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T10:20:48Z","timestamp":1701771648000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Analysis and Synthesis of Digital Dyadic Sequences"],"prefix":"10.1145","volume":"42","author":[{"given":"Abdalla G. M.","family":"Ahmed","sequence":"first","affiliation":[{"name":"KAUST, KSA"}]},{"given":"Mikhail","family":"Skopenkov","sequence":"additional","affiliation":[{"name":"KAUST, KSA"}]},{"given":"Markus","family":"Hadwiger","sequence":"additional","affiliation":[{"name":"KAUST, KSA"}]},{"given":"Peter","family":"Wonka","sequence":"additional","affiliation":[{"name":"KAUST, KSA"}]}],"member":"320","published-online":{"date-parts":[[2023,12,5]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3072959.3073588"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2980179.2980218"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3550454.3555519"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3414685.3417881"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450626.3459880"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-88757-9_6"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/42288.214372"},{"key":"e_1_2_2_8_1","article-title":"Practical Hash-based Owen Scrambling","volume":"10","author":"Burley Brent","year":"2020","unstructured":"Brent Burley. 2020. Practical Hash-based Owen Scrambling. Journal of Computer Graphics Techniques (JCGT) 10, 4 (29 December 2020), 1--20. http:\/\/jcgt.org\/published\/0009\/04\/01\/","journal-title":"Journal of Computer Graphics Techniques (JCGT)"},{"key":"e_1_2_2_9_1","volume-title":"Computer Graphics Forum","author":"Christensen Per","unstructured":"Per Christensen, Andrew Kensler, and Charlie Kilpatrick. 2018. Progressive Multi-Jittered Sample Sequences. In Computer Graphics Forum, Vol. 37. Wiley Online Library, 21--33."},{"key":"e_1_2_2_10_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms (2nd ed.). The MIT Press, Cambridge, Massachusetts.","edition":"2"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761188"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.4064\/aa-41-4-337-351"},{"key":"e_1_2_2_13_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Faure Henri","year":"2000","unstructured":"Henri Faure and Shu Tezuka. 2002. Another Random Scrambling of Digital (t,s)-Sequences. In Monte Carlo and Quasi-Monte Carlo Methods 2000, Kai-Tai Fang, Harald Niederreiter, and Fred J. Hickernell (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 242--256."},{"key":"e_1_2_2_14_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Friedel Ilja","year":"2000","unstructured":"Ilja Friedel and Alexander Keller. 2002. Fast Generation of Randomized Low-Discrepancy Point Sets. In Monte Carlo and Quasi-Monte Carlo Methods 2000. Springer, 257--273."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(85)90121-5"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/89657"},{"key":"e_1_2_2_17_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Gr\u00fcnschlo\u00df Leonhard","year":"2006","unstructured":"Leonhard Gr\u00fcnschlo\u00df, Johannes Hanika, Ronnie Schwede, and Alexander Keller. 2008. (t, m, s)-Nets and Maximized Minimum Distance. In Monte Carlo and Quasi-Monte Carlo Methods 2006, Alexander Keller, Stefan Heinrich, and Harald Niederreiter (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 397--412."},{"key":"e_1_2_2_18_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Gr\u00fcnschlo\u00df Leonhard","year":"2008","unstructured":"Leonhard Gr\u00fcnschlo\u00df and Alexander Keller. 2009. (t, m, s)-Nets and Maximized Minimum Distance, Part II. In Monte Carlo and Quasi-Monte Carlo Methods 2008. Springer, 395--409."},{"key":"e_1_2_2_19_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Gr\u00fcnschlo\u00df Leonhard","year":"2010","unstructured":"Leonhard Gr\u00fcnschlo\u00df, Matthias Raab, and Alexander Keller. 2012. Enumerating Quasi-Monte Carlo Point Sequences in Elementary Intervals. In Monte Carlo and Quasi-Monte Carlo Methods 2010, Leszek Plaskota and Henryk Wo\u017aniakowski (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 399--408."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1749-6632.1960.tb42846.x"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.2312\/sr.20211287"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.4064\/aa141-4-5"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.2478\/udt-2019-0004"},{"key":"e_1_2_2_24_1","volume-title":"Johnson","author":"Horn Roger A.","year":"1985","unstructured":"Roger A. Horn and Charles R. Johnson. 1985. Matrix Analysis. Cambridge University Press, Cambridge."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2018.04.011"},{"key":"e_1_2_2_26_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Keller Alexander","year":"2004","unstructured":"Alexander Keller. 2006. Myths of Computer Graphics. In Monte Carlo and Quasi-Monte Carlo Methods 2004. Springer, 217--243."},{"key":"e_1_2_2_27_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Keller Alexander","year":"2012","unstructured":"Alexander Keller. 2013. Quasi-Monte Carlo Image Synthesis in a Nutshell. In Monte Carlo and Quasi-Monte Carlo Methods 2012, Josef Dick, Frances Y. Kuo, Gareth W. Peters, and Ian H. Sloan (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 213--249."},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00706"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1179352.1141916"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s006050170054"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.4064\/aa106-4-4"},{"key":"e_1_2_2_32_1","volume-title":"A Computer Oriented Geodetic Data Base","author":"Morton GM","year":"1966","unstructured":"GM Morton. 1966. A Computer Oriented Geodetic Data Base; and a New Technique in File Sequencing. (1966)."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294651"},{"key":"e_1_2_2_34_1","doi-asserted-by":"crossref","unstructured":"Harald Niederreiter. 1992. Random Number Generation and Quasi-Monte Carlo Methods. SIAM.","DOI":"10.1137\/1.9781611970081"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276475"},{"key":"e_1_2_2_36_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, Harald Niederreiter and Peter Jau-Shyong Shiue (Eds.)","author":"Owen Art B.","unstructured":"Art B. Owen. 1995. Randomly Permuted (t,m,s)-Nets and (t, s)-Sequences. In Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, Harald Niederreiter and Peter Jau-Shyong Shiue (Eds.). Springer New York, New York, NY, 299--317."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1998.0487"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3478513.3480482"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13366"},{"key":"e_1_2_2_40_1","volume-title":"Physically Based Rendering: From Theory to Implementation","author":"Pharr Matt","unstructured":"Matt Pharr, Wenzel Jakob, and Greg Humphreys. 2016. Physically Based Rendering: From Theory to Implementation (3rd ed.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.","edition":"3"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300000541"},{"key":"e_1_2_2_42_1","volume-title":"Proc. Eurographics '91","volume":"91","author":"Shirley Peter","year":"1991","unstructured":"Peter Shirley. 1991. Discrepancy as a Quality Measure for Sample Distributions. In Proc. Eurographics '91, Vol. 91. 183--194."},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13653"},{"key":"e_1_2_2_44_1","volume-title":"On the Distribution of Points in a Cube and the Approximate Evaluation of Integrals. Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki 7, 4","author":"Sobol' Il'ya Meerovich","year":"1967","unstructured":"Il'ya Meerovich Sobol'. 1967. On the Distribution of Points in a Cube and the Approximate Evaluation of Integrals. Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki 7, 4 (1967), 784--802."},{"key":"e_1_2_2_45_1","unstructured":"Shu Tezuka. 1994. A Generalization of Faure Sequences and its Efficient Implementation. Technical Report IBM Research Tokyo Research Laboratory (1994). 10.13140\/RG.2.2.16748.16003"},{"key":"e_1_2_2_46_1","volume-title":"Verteilungsfunktionen. Proceedings of the Nederlandse Akademie van Wetenschappen 38","author":"J.G. van der Corp","year":"1935","unstructured":"J.G. van der Corput. 1935. Verteilungsfunktionen. Proceedings of the Nederlandse Akademie van Wetenschappen 38 (1935), 813--821."},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601107"},{"key":"e_1_2_2_48_1","volume-title":"Hacker's Delight","author":"Warren Henry S.","unstructured":"Henry S. Warren. 2012. Hacker's Delight (2nd ed.). Addison-Wesley Professional.","edition":"2"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618308","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T10:48:20Z","timestamp":1755773300000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,5]]},"references-count":48,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12,5]]}},"alternative-id":["10.1145\/3618308"],"URL":"https:\/\/doi.org\/10.1145\/3618308","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,5]]},"assertion":[{"value":"2023-12-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}