{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T10:58:41Z","timestamp":1781175521922,"version":"3.54.1"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"ANR","award":["16-CE33-0026 (CALiTrOp), 20-CE45-0025 (MoCaMed)"],"award-info":[{"award-number":["16-CE33-0026 (CALiTrOp), 20-CE45-0025 (MoCaMed)"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>Many applications ranging from quasi-Monte Carlo integration over optimal control to neural networks benefit from high-dimensional, highly uniform samples. In the case of computer graphics, and more particularly in rendering, despite the need for uniformity, several sub-problems expose a low-dimensional structure. In this context, mastering sampling uniformity over projections while preserving high-dimensional uniformity has been intrinsically challenging. This difficulty may explain the relatively small number of mathematical constructions for such samplers. We propose a novel approach by showing that uniformity constraints can be expressed as an integer linear program that results in a sampler with the desired properties. As it turns out, complex constraints are easy to describe by means of stratification and sequence properties of digital nets. Formalized using generator matrix determinants, our new MatBuilder software solves the set of constraints by iterating the linear integer program solver in a greedy fashion to compute a problem-specific set of generator matrices that can be used as a drop-in replacement in the popular digital net samplers. The samplers created by MatBuilder achieve the uniformity of classic low discrepancy sequences. More importantly, we demonstrate the benefit of the unprecedented versatility of our constraint approach with respect to low-dimensional problem structure for several applications.<\/jats:p>","DOI":"10.1145\/3528223.3530063","type":"journal-article","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T21:06:27Z","timestamp":1658523987000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["MatBuilder"],"prefix":"10.1145","volume":"41","author":[{"given":"Lo\u00efs","family":"Paulin","sequence":"first","affiliation":[{"name":"Univ Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Bonneel","sequence":"additional","affiliation":[{"name":"Univ Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David","family":"Coeurjolly","sequence":"additional","affiliation":[{"name":"Univ Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Claude","family":"Iehl","sequence":"additional","affiliation":[{"name":"Univ Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Keller","sequence":"additional","affiliation":[{"name":"Univ Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Victor","family":"Ostromoukhov","sequence":"additional","affiliation":[{"name":"Univ Lyon, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,7,22]]},"reference":[{"key":"e_1_2_2_1_1","article-title":"Low-Discrepancy Blue Noise Sampling","volume":"35","author":"Ahmed Abdalla G. M.","year":"2016","unstructured":"Abdalla G. M. Ahmed, H\u00e9l\u00e8ne Perrier, David Coeurjolly, Victor Ostromoukhov, Jianwei Guo, Dong-Ming Yan, Hui Huang, and Oliver Deussen. 2016. Low-Discrepancy Blue Noise Sampling. ACM Trans. on Graphics (SIGGRAPH Asia) 35, 6 (2016), 13 pages. f9cpt2","journal-title":"ACM Trans. on Graphics (SIGGRAPH Asia)"},{"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","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492913000032"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729331"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729387"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1618452.1618516"},{"key":"e_1_2_2_8_1","volume-title":"Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration","author":"Dick Josef","unstructured":"Josef Dick and Friedrich Pillichshammer. 2010. Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge University Press. hn23"},{"key":"e_1_2_2_9_1","first-page":"59","article-title":"Irreducible Sobol' sequences in prime power bases","volume":"173","author":"Faure Henri","year":"2016","unstructured":"Henri Faure and Christiane Lemieux. 2016. Irreducible Sobol' sequences in prime power bases. Acta Arithmetica 173 (2016), 59--80. hn24","journal-title":"Acta Arithmetica"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.matcom.2018.08.015"},{"key":"e_1_2_2_11_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. cv9gzf"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14061"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/355588.365104"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/ass065"},{"key":"e_1_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Eric Heitz Laurent Belcour Victor Ostromoukhov David Coeurjolly and Jean-Claude Iehl. 2019. A Low-Discrepancy Sampler that Distributes Monte Carlo Errors as a Blue Noise in Screen Space. In ACM SIGGRAPH Talk. 1--2. ggjbxt","DOI":"10.1145\/3306307.3328191"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-98-00894-1"},{"key":"e_1_2_2_17_1","unstructured":"IBM. 2022. IBM ILOG CPLEX Optimizer. https:\/\/www.ibm.com\/analytics\/cplex-optimizer"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13777"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/070709359"},{"key":"e_1_2_2_20_1","volume-title":"Monte Carlo and Quasi-Monte Carlo Methods","author":"Keller Alexander","year":"2002","unstructured":"Alexander Keller. 2004. Stratification by rank-1 lattices. In Monte Carlo and Quasi-Monte Carlo Methods 2002, Harald Niederreiter (Ed.). Springer, 299--313. fks8z8"},{"key":"e_1_2_2_21_1","volume-title":"Advanced (Quasi) Monte Carlo Methods for Image Synthesis. In ACM SIGGRAPH 2012 Courses. Article 21","author":"Keller Alexander","year":"2012","unstructured":"Alexander Keller, Simon Premo\u017ee, and Matthias Raab. 2012. Advanced (Quasi) Monte Carlo Methods for Image Synthesis. In ACM SIGGRAPH 2012 Courses. Article 21. gfzncb"},{"key":"e_1_2_2_22_1","volume-title":"MCQMC 2020 (Lecture Notes in Statistics). Springer","author":"Keller Alexander","year":"2022","unstructured":"Alexander Keller and Matthijs Van keirsbilck. 2022. Artificial Neural Networks generated by Low Discrepancy Sequences. In Monte Carlo and Quasi-Monte Carlo Methods, MCQMC 2020 (Lecture Notes in Statistics). Springer, to appear."},{"key":"e_1_2_2_23_1","unstructured":"Leslie Kish. 1965. Survey Sampling. John Wiley & Sons."},{"key":"e_1_2_2_24_1","volume-title":"Efficient Multidimensional Sampling. Computer Graphics Forum (Proc. Eurographics 2002) 21, 3 (Sept","author":"Kollig Thomas","year":"2002","unstructured":"Thomas Kollig and Alexander Keller. 2002. Efficient Multidimensional Sampling. Computer Graphics Forum (Proc. Eurographics 2002) 21, 3 (Sept. 2002), 557--563. d2stpx"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2318896.2318900"},{"key":"e_1_2_2_26_1","unstructured":"Anass Lasram Sylvain Lefebvre and Cyrille Damez. 2012b. Scented Sliders for Procedural Textures. In EUROGRAPHICS short papers (Proceedings of the Eurographics conference (short papers)). Cagliari Italy 4 pages. https:\/\/hal.inria.fr\/hal-00748188"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2754929"},{"key":"e_1_2_2_28_1","volume-title":"Monte Carlo and Quasi Monte Carlo Sampling","author":"Lemieux Christiane","unstructured":"Christiane Lemieux. 2009. Monte Carlo and Quasi Monte Carlo Sampling. Springer. b8r4z5"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2019.2913418"},{"key":"e_1_2_2_30_1","volume-title":"Random Number Generation and quasi-Monte Carlo Methods","author":"Niederreiter Harald","unstructured":"Harald Niederreiter. 1992. Random Number Generation and quasi-Monte Carlo Methods. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, USA. fd5fjw"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.1998.745036"},{"key":"e_1_2_2_32_1","unstructured":"Art B. Owen. 2013. Monte Carlo Theory Methods and Examples. https:\/\/statweb.stanford.edu\/~owen\/mc\/ Preprint."},{"key":"e_1_2_2_33_1","doi-asserted-by":"crossref","unstructured":"Lo\u00efs Paulin Nicolas Bonneel David Coeurjolly Jean-Claude Iehl Alexander Keller and Victor Ostromoukhov. 2022. MatBuilder: Mastering Sampling Uniformity over Projections. https:\/\/github.com\/loispaulin\/matbuilder","DOI":"10.1145\/3528223.3530063"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392395"},{"key":"e_1_2_2_35_1","article-title":"Cascaded Sobol","volume":"40","author":"Paulin Lo\u00efs","year":"2021","unstructured":"Lo\u00efs Paulin, David Coeurjolly, Jean-Claude Iehl, Nicolas Bonneel, Alexander Keller, and Victor Ostromoukhov. 2021. Cascaded Sobol' Sampling. ACM Trans. on Graphics (SIGGRAPH Asia) 40, 6 (2021), 274:1--274:13. hn3b","journal-title":"Sampling. ACM Trans. on Graphics (SIGGRAPH Asia)"},{"key":"e_1_2_2_36_1","volume-title":"Sequences with Low-Discrepancy Blue-Noise 2-D Projections. 37, 2","author":"Perrier H\u00e9l\u00e8ne","year":"2018","unstructured":"H\u00e9l\u00e8ne Perrier, David Coeurjolly, Feng Xie, Matt Pharr, Pat Hanrahan, and Victor Ostromoukhov. 2018. Sequences with Low-Discrepancy Blue-Noise 2-D Projections. 37, 2 (2018), 339--353. gd2j2d"},{"key":"e_1_2_2_37_1","unstructured":"Matt Pharr Wenzel Jakob and Greg Humphreys. 2016. Physically Based Rendering: From Theory to Implementation. Morgan Kaufmann."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766930"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/33.4.305"},{"key":"e_1_2_2_40_1","volume-title":"2nd Eurographics Workshop on Rendering. Springer","author":"Schlick Christophe","year":"1991","unstructured":"Christophe Schlick. 1991. An Adaptive Sampling Technique for Multidimensional Integration by Ray-Tracing. In 2nd Eurographics Workshop on Rendering. Springer, Barcelona, Spain, 21--29. chvsz2"},{"key":"e_1_2_2_41_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' Ilya M.","year":"1967","unstructured":"Ilya M. 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. crdj6j"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1002\/wilm.10056"},{"key":"e_1_2_2_43_1","volume-title":"Integer Programming","author":"Wolsey Laurence A.","unstructured":"Laurence A. Wolsey. 2020. Integer Programming. John Wiley & Sons."},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.12.017"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528223.3530063","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3528223.3530063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:25Z","timestamp":1750186945000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528223.3530063"}},"subtitle":["mastering sampling uniformity over projections"],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.1145\/3528223.3530063"],"URL":"https:\/\/doi.org\/10.1145\/3528223.3530063","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7]]},"assertion":[{"value":"2022-07-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}