{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T22:17:16Z","timestamp":1779315436527,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,29]],"date-time":"2022-11-29T00:00:00Z","timestamp":1669680000000},"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":[],"published-print":{"date-parts":[[2022,11,29]]},"DOI":"10.1145\/3550469.3555388","type":"proceedings-article","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T11:07:54Z","timestamp":1669806474000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Marginal Multiple Importance Sampling"],"prefix":"10.1145","author":[{"given":"Rex","family":"West","sequence":"first","affiliation":[{"name":"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":"Toshiya","family":"Hachisuka","sequence":"additional","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,11,30]]},"reference":[{"key":"e_1_3_2_3_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3130800.3130886"},{"key":"e_1_3_2_3_2_1","volume-title":"Proceedings of the 13th Eurographics Workshop on Rendering. Eurographics Association, 125\u2013134","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\u2013134."},{"key":"e_1_3_2_3_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3478513.3480547"},{"key":"e_1_3_2_3_4_1","volume-title":"Light Transport Simulation with Vertex Connection and Merging. 31, 6 (Nov","author":"Georgiev Iliyan","year":"2012","unstructured":"Iliyan Georgiev, Jaroslav K\u0159iv\u00e1nek, Tom\u00e1\u0161 Davidovi\u010d, and Philipp Slusallek. 2012. Light Transport Simulation with Vertex Connection and Merging. 31, 6 (Nov. 2012), 192:1\u2013192:10. https:\/\/doi.org\/10\/gbb6q7"},{"key":"e_1_3_2_3_5_1","volume-title":"Progressive Photon Mapping. 27, 5 (Dec","author":"Hachisuka Toshiya","year":"2008","unstructured":"Toshiya Hachisuka, Shinji Ogaki, and Henrik\u00a0Wann Jensen. 2008. Progressive Photon Mapping. 27, 5 (Dec. 2008), 130:1\u2013130:8. https:\/\/doi.org\/10\/cn8h39"},{"key":"e_1_3_2_3_6_1","volume-title":"A Path Space Extension for Robust Light Transport Simulation. 31, 6 (Jan","author":"Hachisuka Toshiya","year":"2012","unstructured":"Toshiya Hachisuka, Jacopo Pantaleoni, and Henrik\u00a0Wann Jensen. 2012. A Path Space Extension for Robust Light Transport Simulation. 31, 6 (Jan. 2012), 191:1\u2013191:10. https:\/\/doi.org\/10\/gbb6n3"},{"key":"e_1_3_2_3_8_1","volume-title":"The Rendering Equation. 20, 4 (Aug","author":"Kajiya T.","year":"1986","unstructured":"James\u00a0T. Kajiya. 1986. The Rendering Equation. 20, 4 (Aug. 1986), 143\u2013150. https:\/\/doi.org\/10\/cvf53j"},{"key":"e_1_3_2_3_9_1","first-page":"1","article-title":"Path Space Filtering(SIGGRAPH \u201914)","volume":"68","author":"Keller Alexander","year":"2014","unstructured":"Alexander Keller, Ken Dahm, and Nikolaus Binder. 2014. Path Space Filtering(SIGGRAPH \u201914). ACM, 68:1\u201368:1. https:\/\/doi.org\/10\/gfz6mr","journal-title":"ACM"},{"key":"e_1_3_2_3_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3528223.3530160"},{"key":"e_1_3_2_3_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818119"},{"key":"e_1_3_2_3_13_1","doi-asserted-by":"crossref","unstructured":"Eric Veach and Leonidas\u00a0J. Guibas. 1995. Optimally Combining Sampling Techniques for Monte Carlo Rendering Vol.\u00a029. 419\u2013428. https:\/\/doi.org\/10\/d7b6n4","DOI":"10.1145\/218380.218498"},{"key":"e_1_3_2_3_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392436"}],"event":{"name":"SA '22: SIGGRAPH Asia 2022","location":"Daegu Republic of Korea","acronym":"SA '22","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"]},"container-title":["SIGGRAPH Asia 2022 Conference Papers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3550469.3555388","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3550469.3555388","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:44Z","timestamp":1750182704000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3550469.3555388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,29]]},"references-count":12,"alternative-id":["10.1145\/3550469.3555388","10.1145\/3550469"],"URL":"https:\/\/doi.org\/10.1145\/3550469.3555388","relation":{},"subject":[],"published":{"date-parts":[[2022,11,29]]},"assertion":[{"value":"2022-11-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}