{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T15:09:24Z","timestamp":1762096164982,"version":"build-2065373602"},"reference-count":32,"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>We present a novel algorithm for implementing Owen-scrambling, combining the generation and distribution of the scrambling bits in a single self-contained compact process. We employ a context-free grammar to build a binary tree of symbols, and equip each symbol with a scrambling code that affects all descendant nodes. We nominate the grammar of adaptive regular tiles (ART) derived from the repetition-avoiding Thue-Morse word, and we discuss its potential advantages and shortcomings. Our algorithm has many advantages, including random access to samples, fixed time complexity, GPU friendliness, and scalability to any memory budget. Further, it provides two unique features over known methods: it admits optimization, and it is in-vertible, enabling screen-space scrambling of the high-dimensional Sobol sampler.<\/jats:p>","DOI":"10.1145\/3618307","type":"journal-article","created":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T10:20:48Z","timestamp":1701771648000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["ART-Owen Scrambling"],"prefix":"10.1145","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2348-6897","authenticated-orcid":false,"given":"Abdalla G. M.","family":"Ahmed","sequence":"first","affiliation":[{"name":"KAUST, KSA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0566-8291","authenticated-orcid":false,"given":"Matt","family":"Pharr","sequence":"additional","affiliation":[{"name":"NVIDIA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0627-9746","authenticated-orcid":false,"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\/3414685.3417881"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450626.3459880"},{"key":"e_1_2_2_4_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 Dec. 2020), 1--20. http:\/\/jcgt.org\/published\/0009\/04\/01\/","journal-title":"Journal of Computer Graphics Techniques (JCGT)"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13472"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0713071"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511761188"},{"key":"e_1_2_2_8_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."},{"volume-title":"Principles of Digital Image Synthesis","author":"Glassner Andrew S","key":"e_1_2_2_9_1","unstructured":"Andrew S Glassner. 1995. Principles of Digital Image Synthesis. Elsevier."},{"key":"e_1_2_2_10_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. Springer, 397--412."},{"key":"e_1_2_2_11_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_12_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. Springer, 399--408."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.2312\/sr.20211287"},{"key":"e_1_2_2_14_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. Springer, 213--249."},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00706"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141916"},{"volume-title":"Algebraic Combinatorics on Words","author":"Lothaire M.","key":"e_1_2_2_17_1","unstructured":"M. Lothaire. 2002. Algebraic Combinatorics on Words. Cambridge University Press."},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1998.0489"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/37402.37410"},{"key":"e_1_2_2_20_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_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276475"},{"volume-title":"Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing","author":"Owen Art B.","key":"e_1_2_2_22_1","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. Springer, 299--317."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1998.0487"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/945511.945518"},{"key":"e_1_2_2_25_1","article-title":"Efficient Generation of Points that Satisfy Two-Dimensional Elementary Intervals","volume":"8","author":"Pharr Matt","year":"2019","unstructured":"Matt Pharr. 2019. Efficient Generation of Points that Satisfy Two-Dimensional Elementary Intervals. Journal of Computer Graphics Techniques (JCGT) 8, 1 (27 Feb. 2019), 56--68. http:\/\/jcgt.org\/published\/0008\/01\/04\/","journal-title":"Journal of Computer Graphics Techniques (JCGT)"},{"key":"e_1_2_2_26_1","volume-title":"Physically Based Rendering: From Theory to Implementation","author":"Pharr Matt","unstructured":"Matt Pharr, Wenzel Jakob, and Greg Humphreys. 2023. Physically Based Rendering: From Theory to Implementation (4th ed.). MIT Press.","edition":"4"},{"key":"e_1_2_2_27_1","volume-title":"A mathematical Theory of Communication. The Bell system technical journal 27, 3","author":"Shannon Claude E","year":"1948","unstructured":"Claude E Shannon. 1948. A mathematical Theory of Communication. The Bell system technical journal 27, 3 (1948), 379--423."},{"key":"e_1_2_2_28_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_29_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_30_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"},{"volume-title":"Digital Halftoning","author":"Ulichney Robert","key":"e_1_2_2_31_1","unstructured":"Robert Ulichney. 1987. Digital Halftoning. MIT Press."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601107"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618307","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3618307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T10:48:17Z","timestamp":1755773297000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3618307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,5]]},"references-count":32,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12,5]]}},"alternative-id":["10.1145\/3618307"],"URL":"https:\/\/doi.org\/10.1145\/3618307","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"type":"print","value":"0730-0301"},{"type":"electronic","value":"1557-7368"}],"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"}}]}}