{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T22:17:12Z","timestamp":1779315432252,"version":"3.51.4"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T00:00:00Z","timestamp":1597190400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2020,8,31]]},"abstract":"<jats:p>Multiple importance sampling (MIS) is a provably good way to combine a finite set of sampling techniques to reduce variance in Monte Carlo integral estimation. However, there exist integration problems for which a continuum of sampling techniques is available. To handle such cases we establish a continuous MIS (CMIS) formulation as a generalization of MIS to uncountably infinite sets of techniques. Our formulation is equipped with a base estimator that is coupled with a provably optimal balance heuristic and a practical stochastic MIS (SMIS) estimator that makes CMIS accessible to a broad range of problems. To illustrate the effectiveness and utility of our framework, we apply it to three different light transport applications, showing improved performance over the prior state-of-the-art techniques.<\/jats:p>","DOI":"10.1145\/3386569.3392436","type":"journal-article","created":{"date-parts":[[2020,8,12]],"date-time":"2020-08-12T11:44:27Z","timestamp":1597232667000},"update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":34,"title":["Continuous multiple importance sampling"],"prefix":"10.1145","volume":"39","author":[{"given":"Rex","family":"West","sequence":"first","affiliation":[{"name":"The University of Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iliyan","family":"Georgiev","sequence":"additional","affiliation":[{"name":"Autodesk, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrien","family":"Gruson","sequence":"additional","affiliation":[{"name":"McGill University, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiya","family":"Hachisuka","sequence":"additional","affiliation":[{"name":"The University of Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,8,12]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Anonymous. \"Two random variables were talking in a bar. They thought they were being discrete but I heard their chatter continuously\". Annals of Statistical Jokes."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130800.3130886"},{"key":"e_1_2_2_3_1","volume-title":"Proceedings of the 13th Eurographics Workshop on Rendering. Eurographics Association, 125--134","author":"Bekaert Philippe","year":"2002","unstructured":"Philippe Bekaert, Mateu Sbert, and John Halton. 2002. Accelerating Path Tracing by Re-Using Paths. In Proceedings of the 13th Eurographics Workshop on Rendering. Eurographics Association, 125--134."},{"key":"e_1_2_2_4_1","volume-title":"Unbiased Monte Carlo Estimation of the Reciprocal of an Integral. 156, 3","author":"Booth T. E.","year":"2007","unstructured":"T. E. Booth. 2007. Unbiased Monte Carlo Estimation of the Reciprocal of an Integral. 156, 3 (2007), 403--407. https:\/\/doi.org\/10\/gfzq76"},{"key":"e_1_2_2_5_1","volume-title":"Stochastic Sampling in Computer Graphics. 5, 1 (Jan","author":"Cook Robert L.","year":"1986","unstructured":"Robert L. Cook. 1986. Stochastic Sampling in Computer Graphics. 5, 1 (Jan. 1986), 51--72. https:\/\/doi.org\/10\/cqwhcc"},{"key":"e_1_2_2_6_1","volume-title":"Distributed Ray Tracing. 18, 3 (July","author":"Cook Robert L.","year":"1984","unstructured":"Robert L. Cook, Thomas Porter, and Loren Carpenter. 1984. Distributed Ray Tracing. 18, 3 (July 1984), 137--145. https:\/\/doi.org\/10\/c9thc3"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3306346.3323041"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1214\/18-STS668"},{"key":"e_1_2_2_9_1","volume-title":"Elements of Set Theory","author":"Enderton H.B.","unstructured":"H.B. Enderton. Elements of Set Theory. Elsevier Science."},{"key":"e_1_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Iliyan Georgiev and Marcos Fajardo. 2016. Blue-Noise Dithered Sampling. 35:1--35:1. https:\/\/doi.org\/10\/gfznbx","DOI":"10.1145\/2897839.2927430"},{"key":"e_1_2_2_11_1","volume-title":"Importance Caching for Complex Illumination. 31, 2 (June","author":"Georgiev Iliyan","year":"2012","unstructured":"Iliyan Georgiev, Jaroslav K\u0159iv\u00e1nek, Stefan Popov, and Philipp Slusallek. 2012. Importance Caching for Complex Illumination. 31, 2 (June 2012), 701--710. https:\/\/doi.org\/10\/gbbdcc"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355089.3356515"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","unstructured":"Vlastimil Havran and Mateu Sbert. 2014. Optimal combination of techniques in multiple importance sampling. 141--150. 10.1145\/2670473.2670496","DOI":"10.1145\/2670473.2670496"},{"key":"e_1_2_2_14_1","volume-title":"A Characterization of Strong Orthogonal Arrays of Strength Three. 42, 4","author":"He Yuanzhen","year":"2014","unstructured":"Yuanzhen He and Boxin Tang. 2014. A Characterization of Strong Orthogonal Arrays of Strength Three. 42, 4 (2014), 1347--1360. https:\/\/doi.org\/10\/gfznb4"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13778"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13652"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13626"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02418571"},{"key":"e_1_2_2_19_1","volume-title":"The Rendering Equation. 20, 4 (Aug","author":"Kajiya James T.","year":"1986","unstructured":"James T. Kajiya. 1986. The Rendering Equation. 20, 4 (Aug. 1986), 143--150. https:\/\/doi.org\/10\/cvf53j"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355089.3356565"},{"key":"e_1_2_2_21_1","first-page":"1","article-title":"Path Space Filtering (SIGGRAPH '14)","volume":"68","author":"Keller Alexander","year":"2014","unstructured":"Alexander Keller, Ken Dahm, and Nikolaus Binder. 2014. Path Space Filtering (SIGGRAPH '14). ACM, 68:1--68:1. https:\/\/doi.org\/10\/gfz6mr","journal-title":"ACM"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3306346.3323009"},{"key":"e_1_2_2_23_1","volume-title":"Radiance Caching for Efficient Global Illumination Computation. 11, 5","author":"K\u0159iv\u00e1nek Jaroslav","year":"2005","unstructured":"Jaroslav K\u0159iv\u00e1nek, Pascal Gautron, Sumanta Pattanaik, and Kadi Bouatouch. 2005. Radiance Caching for Efficient Global Illumination Computation. 11, 5 (2005), 550--561. https:\/\/doi.org\/10\/csf2sw"},{"key":"e_1_2_2_24_1","volume-title":"Beams, and Paths in Volumetric Light Transport Simulation. 33, 4 (July","author":"K\u0159iv\u00e1nek Jaroslav","year":"2014","unstructured":"Jaroslav K\u0159iv\u00e1nek, Iliyan Georgiev, Toshiya Hachisuka, Petr V\u00e9voda, Martin \u0160ik, Derek Nowrouzezahrai, and Wojciech Jarosz. 2014. Unifying Points, Beams, and Paths in Volumetric Light Transport Simulation. 33, 4 (July 2014), 103:1--103:13. https:\/\/doi.org\/10\/f6cz72"},{"key":"e_1_2_2_25_1","unstructured":"Morgan McGuire. 2017. Computer Graphics Archive. https:\/\/casual-effects.com\/data"},{"key":"e_1_2_2_26_1","volume-title":"Representativity for Robust and Adaptive Multiple Importance Sampling. 17, 8","author":"Pajot Anthony","year":"2011","unstructured":"Anthony Pajot, Loic Barthe, Mathias Paulin, and Pierre Poulin. 2011. Representativity for Robust and Adaptive Multiple Importance Sampling. 17, 8 (2011), 1108--1121. https:\/\/doi.org\/10\/dpg3dn"},{"key":"e_1_2_2_27_1","first-page":"4","article-title":"Probabilistic Connections for Bidirectional Path","volume":"34","author":"Popov Stefan","year":"2015","unstructured":"Stefan Popov, Ravi Ramamoorthi, Fredo Durand, and George Drettakis. 2015. Probabilistic Connections for Bidirectional Path Tracing. Comput. Graph. Forum 34, 4 (July 2015), 75--86.","journal-title":"Tracing. Comput. Graph. Forum"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-017-1398-1"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13042"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13634-018-0531-2"},{"key":"e_1_2_2_31_1","volume-title":"Richard Mitanchey, and Bernard P\u00e9roche.","author":"Segovia Benjamin","year":"2006","unstructured":"Benjamin Segovia, Jean Claude Iehl, Richard Mitanchey, and Bernard P\u00e9roche. 2006. Bidirectional Instant Radiosity. 389--397."},{"key":"e_1_2_2_32_1","unstructured":"Eric Veach. 1997. Robust Monte Carlo Methods for Light Transport Simulation. Ph.D. Thesis. Stanford University United States - California."},{"key":"e_1_2_2_33_1","volume-title":"Guibas","author":"Veach Eric","year":"1995","unstructured":"Eric Veach and Leonidas J. Guibas. 1995. Optimally Combining Sampling Techniques for Monte Carlo Rendering, Vol. 29. 419--428. https:\/\/doi.org\/10\/d7b6n4"},{"key":"e_1_2_2_34_1","volume-title":"Heckbert","author":"Ward Gregory J.","year":"1992","unstructured":"Gregory J. Ward and Paul S. Heckbert. 1992. Irradiance Gradients. In CE_EGWR93, Alan Chalmers, Derek Paddon, and Fran\u00e7ois X. Sillion (Eds.). Consolidation Express Bristol, 85--98."},{"key":"e_1_2_2_35_1","volume-title":"Hero Wavelength Spectral Sampling. 33, 4 (June","author":"Wilkie Alexander","year":"2014","unstructured":"Alexander Wilkie, Sehera Nawaz, Marc Droske, Andrea Weidlich, and Johannes Hanika. 2014. Hero Wavelength Spectral Sampling. 33, 4 (June 2014), 123--131. https:\/\/doi.org\/10\/f6fgb4"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3386569.3392436","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3386569.3392436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T05:41:51Z","timestamp":1750830111000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3386569.3392436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,12]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,8,31]]}},"alternative-id":["10.1145\/3386569.3392436"],"URL":"https:\/\/doi.org\/10.1145\/3386569.3392436","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,12]]},"assertion":[{"value":"2020-08-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}