{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T11:25:03Z","timestamp":1761218703813,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["GRK 2853\/1 project number 471607914"],"award-info":[{"award-number":["GRK 2853\/1 project number 471607914"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007214","name":"Velux Stiftung","doi-asserted-by":"publisher","award":["1350"],"award-info":[{"award-number":["1350"]}],"id":[{"id":"10.13039\/100007214","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,3]]},"DOI":"10.1145\/3680528.3687636","type":"proceedings-article","created":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T08:14:37Z","timestamp":1733213677000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["MARS: Multi-sample Allocation through Russian roulette and Splitting"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-8703-1136","authenticated-orcid":false,"given":"Joshua","family":"Meyer","sequence":"first","affiliation":[{"name":"Saarland Informatics Campus, Saarbr\u00fccken, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6084-2942","authenticated-orcid":false,"given":"Alexander","family":"Rath","sequence":"additional","affiliation":[{"name":"Saarland Informatics Campus, Saarbr\u00fccken, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0306-757X","authenticated-orcid":false,"given":"\u00d6mercan","family":"Yazici","sequence":"additional","affiliation":[{"name":"Saarland Informatics Campus, Saarbr\u00fccken, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2189-2429","authenticated-orcid":false,"given":"Philipp","family":"Slusallek","sequence":"additional","affiliation":[{"name":"German Research Center for Artificial Intelligence, Saarbr\u00fccken, Germany and Saarland Informatics Campus, Saarbr\u00fccken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"e_1_3_3_2_2_1","unstructured":"Attila\u00a0T. \u00c1fra. 2019. Intel\u00ae Open Image Denoise. https:\/\/www.openimagedenoise.org\/"},{"key":"e_1_3_3_2_3_1","doi-asserted-by":"publisher","unstructured":"James Arvo and David Kirk. 1990. Particle Transport and Image Synthesis. ACM SIGGRAPH Computer Graphics 24 4 (Sept. 1990) 63\u201366. 10.1145\/97880.97886https:\/\/dl.acm.org\/doi\/10.1145\/97880.97886","DOI":"10.1145\/97880.97886"},{"key":"e_1_3_3_2_4_1","unstructured":"Benedikt Bitterli. 2016. Rendering resources. https:\/\/benedikt-bitterli.me\/resources\/"},{"key":"e_1_3_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-6858-5_6"},{"key":"e_1_3_3_2_6_1","doi-asserted-by":"publisher","unstructured":"Pascal Grittmann \u00d6mercan Yazici Iliyan Georgiev and Philipp Slusallek. 2022. Efficiency-Aware Multiple Importance Sampling for Bidirectional Rendering Algorithms. ACM Transactions on Graphics 41 4 (July 2022) 80:1\u201380:12. 10.1145\/3528223.3530126https:\/\/dl.acm.org\/doi\/10.1145\/3528223.3530126","DOI":"10.1145\/3528223.3530126"},{"key":"e_1_3_3_2_7_1","doi-asserted-by":"publisher","unstructured":"Johannes Hanika Marc Droske and Luca Fascione. 2015. Manifold Next Event Estimation. Computer Graphics Forum 34 4 (July 2015) 87\u201397. 10.1111\/cgf.12681","DOI":"10.1111\/cgf.12681"},{"key":"e_1_3_3_2_8_1","unstructured":"Wenzel Jakob. 2010. Mitsuba Renderer. https:\/\/mitsuba-renderer.org\/"},{"key":"e_1_3_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-9430-0_31"},{"key":"e_1_3_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/15922.15902"},{"key":"e_1_3_3_2_11_1","doi-asserted-by":"publisher","unstructured":"Ivo Kondapaneni Petr Vevoda Pascal Grittmann Tom\u00e1\u0161 Sk\u0159ivan Philipp Slusallek and Jaroslav K\u0159iv\u00e1nek. 2019. Optimal Multiple Importance Sampling. ACM Transactions on Graphics 38 4 (July 2019) 37:1\u201337:14. 10.1145\/3306346.3323009https:\/\/dl.acm.org\/doi\/10.1145\/3306346.3323009","DOI":"10.1145\/3306346.3323009"},{"key":"e_1_3_3_2_12_1","unstructured":"Eric\u00a0P. Lafortune and Y. Willems. 1993. Bi-Directional Path Tracing."},{"key":"e_1_3_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12220"},{"key":"e_1_3_3_2_14_1","doi-asserted-by":"publisher","unstructured":"Thomas M\u00fcller Markus Gross and Jan Nov\u00e1k. 2017. Practical Path Guiding for Efficient Light-Transport Simulation. Computer Graphics Forum 36 4 (2017) 91\u2013100. 10.1111\/cgf.13227 https:\/\/dl.acm.org\/doi\/10.1111\/cgf.13227","DOI":"10.1111\/cgf.13227"},{"key":"e_1_3_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.2312\/egs.20201009"},{"key":"e_1_3_3_2_16_1","doi-asserted-by":"publisher","unstructured":"Kosuke Nabata Kei Iwasaki and Yoshinori Dobashi. 2020. Resampling-Aware Weighting Functions for Bidirectional Path Tracing Using Multiple Light Sub-Paths. ACM Transactions on Graphics 39 2 (March 2020) 15:1\u201315:11. 10.1145\/3338994https:\/\/dl.acm.org\/doi\/10.1145\/3338994","DOI":"10.1145\/3338994"},{"key":"e_1_3_3_2_17_1","volume-title":"Physically Based Rendering: From Theory to Implementation (3rd Ed.)","author":"Pharr Matt","year":"2016","unstructured":"Matt Pharr, Wenzel Jakob, and Greg Humphreys (Eds.). 2016. Physically Based Rendering: From Theory to Implementation (3rd Ed.). Morgan Kaufmann Publishers Inc."},{"key":"e_1_3_3_2_18_1","doi-asserted-by":"publisher","unstructured":"Stefan Popov Ravi Ramamoorthi Fredo Durand and George Drettakis. 2015. Probabilistic Connections for Bidirectional Path Tracing. Computer Graphics Forum 34 4 (2015) 75\u201386. 10.1111\/cgf.12680","DOI":"10.1111\/cgf.12680"},{"key":"e_1_3_3_2_19_1","doi-asserted-by":"publisher","unstructured":"Alexander Rath Pascal Grittmann Sebastian Herholz Petr V\u00e9voda Philipp Slusallek and Jaroslav K\u0159iv\u00e1nek. 2020. Variance-Aware Path Guiding. ACM Transactions on Graphics (TOG) 39 4 (Aug. 2020) 151:1\u2013151:12. 10.1145\/3386569.3392441https:\/\/dl.acm.org\/doi\/10.1145\/3386569.3392441","DOI":"10.1145\/3386569.3392441"},{"key":"e_1_3_3_2_20_1","doi-asserted-by":"publisher","unstructured":"Alexander Rath Pascal Grittmann Sebastian Herholz Philippe Weier and Philipp Slusallek. 2022. EARS: Efficiency-Aware Russian Roulette and Splitting. ACM Transactions on Graphics 41 4 (July 2022) 81:1\u201381:14. 10.1145\/3528223.3530168https:\/\/dl.acm.org\/doi\/10.1145\/3528223.3530168","DOI":"10.1145\/3528223.3530168"},{"key":"e_1_3_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588432.3591543"},{"key":"e_1_3_3_2_22_1","doi-asserted-by":"publisher","unstructured":"Lukas Ruppert Sebastian Herholz and Hendrik P.\u00a0A. Lensch. 2020. Robust Fitting of Parallax-Aware Mixtures for Path Guiding. ACM Transactions on Graphics 39 4 (Aug. 2020) 147:1\u2013147:15. 10.1145\/3386569.3392421https:\/\/dl.acm.org\/doi\/10.1145\/3386569.3392421","DOI":"10.1145\/3386569.3392421"},{"key":"e_1_3_3_2_23_1","doi-asserted-by":"publisher","unstructured":"Mateu Sbert Vlastimil Havran and L\u00e1szl\u00f3 Szirmay-Kalos. 2019. Optimal Deterministic Mixture Sampling. Eurographics 2019 - Short Papers 73 (2019) 4 pages. 10.2312\/EGS.20191018","DOI":"10.2312\/EGS.20191018"},{"key":"e_1_3_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.2312\/EGS.20221022"},{"key":"e_1_3_3_2_25_1","doi-asserted-by":"crossref","unstructured":"Eric Veach. 1997. Robust Monte Carlo Methods for Light Transport Simulation. Ph.\u00a0D. Dissertation. Stanford University CA USA. Advisor(s) Guibas Leonidas J.","DOI":"10.1145\/258734.258775"},{"key":"e_1_3_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-87825-1_11"},{"key":"e_1_3_3_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/218380.218498"},{"key":"e_1_3_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3305366.3328091"},{"key":"e_1_3_3_2_29_1","doi-asserted-by":"publisher","unstructured":"Ji\u0159\u00ed Vorba Ond\u0159ej Karl\u00edk Martin \u0160ik Tobias Ritschel and Jaroslav K\u0159iv\u00e1nek. 2014. On-Line Learning of Parametric Mixture Models for Light Transport Simulation. ACM Transactions on Graphics 33 4 (July 2014) 101:1\u2013101:11. 10.1145\/2601097.2601203https:\/\/dl.acm.org\/doi\/10.1145\/2601097.2601203","DOI":"10.1145\/2601097.2601203"},{"key":"e_1_3_3_2_30_1","doi-asserted-by":"publisher","unstructured":"Ji\u0159\u00ed Vorba and Jaroslav K\u0159iv\u00e1nek. 2016. Adjoint-Driven Russian Roulette and Splitting in Light Transport Simulation. ACM Transactions on Graphics 35 4 (July 2016) 42:1\u201342:11. 10.1145\/2897824.2925912https:\/\/dl.acm.org\/doi\/10.1145\/2897824.2925912","DOI":"10.1145\/2897824.2925912"},{"key":"e_1_3_3_2_31_1","doi-asserted-by":"publisher","unstructured":"Tizian Zeltner Iliyan Georgiev and Wenzel Jakob. 2020. Specular Manifold Sampling for Rendering High-Frequency Caustics and Glints. ACM Transactions on Graphics 39 4 (Aug. 2020) 149:1\u2013149:15. 10.1145\/3386569.3392408https:\/\/dl.acm.org\/doi\/10.1145\/3386569.3392408","DOI":"10.1145\/3386569.3392408"},{"key":"e_1_3_3_2_32_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13335"}],"event":{"name":"SA '24: SIGGRAPH Asia 2024 Conference Papers","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"location":"Tokyo Japan","acronym":"SA '24"},"container-title":["SIGGRAPH Asia 2024 Conference Papers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3680528.3687636","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3680528.3687636","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:58:27Z","timestamp":1750294707000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3680528.3687636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"references-count":31,"alternative-id":["10.1145\/3680528.3687636","10.1145\/3680528"],"URL":"https:\/\/doi.org\/10.1145\/3680528.3687636","relation":{},"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"2024-12-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}