{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T15:48:05Z","timestamp":1782748085890,"version":"3.54.5"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T00:00:00Z","timestamp":1782691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Comput. Graph. Interact. Tech."],"published-print":{"date-parts":[[2026,7,1]]},"abstract":"<jats:p>Reservoir-based spatiotemporal importance resampling (ReSTIR) improves convergence of real-time Monte Carlo rendering by reusing samples between pixels and frames. Recent reservoir splatting and area ReSTIR methods improve ReSTIR\u2019s temporal robustness in challenging scenes, but much less work focuses on improving spatial reuse. We present a novel neighbor selection algorithm for ReSTIR\u2019s spatial reuse. Our simple method works with any pixel-space ReSTIR technique to improve image quality; we reduce SMAPE by 6\u201329% while also decreasing temporal covariance by 22\u201349%, all with a 2\u20135% incremental cost. We ground our work in an analysis of path compatibility between pixels and an empirical evaluation of the fundamental error-correlation tradeoff in ReSTIR; we improve the Pareto frontier of this tradeoff and provide tunable control over the balance between variance and correlation.<\/jats:p>","DOI":"10.1145\/3820024","type":"journal-article","created":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T15:37:39Z","timestamp":1782747459000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Compatibility-Guided Neighbor Selection for ReSTIR 52"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-7061-2035","authenticated-orcid":false,"given":"Orion","family":"Junkins","sequence":"first","affiliation":[{"name":"ETH Z\u00fcrich","place":["Zurich, Switzerland"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5206-9603","authenticated-orcid":false,"given":"Markus","family":"Kettunen","sequence":"additional","affiliation":[{"name":"NVIDIA","place":["Helsinki, Finland"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5139-6418","authenticated-orcid":false,"given":"Daqi","family":"Lin","sequence":"additional","affiliation":[{"name":"NVIDIA","place":["Redmond, USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3993-5789","authenticated-orcid":false,"given":"Ravi","family":"Ramamoorthi","sequence":"additional","affiliation":[{"name":"University of California, San Diego","place":["La Jolla, USA"]},{"name":"NVIDIA","place":["La Jolla, USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5133-4292","authenticated-orcid":false,"given":"Chris","family":"Wyman","sequence":"additional","affiliation":[{"name":"NVIDIA","place":["Redmond, USA"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,29]]},"reference":[{"key":"e_1_3_4_2_1","doi-asserted-by":"publisher","unstructured":"Pablo Bauszat Victor Petitjean and Elmar Eisemann. 2017. Gradient-domain path reusing. ACM Trans. Graph. 36 6 Article 229 (Nov. 2017) 9\u00a0pages. doi:10.1145\/3130800.3130886","DOI":"10.1145\/3130800.3130886"},{"key":"e_1_3_4_3_1","doi-asserted-by":"publisher","DOI":"10.2312\/EGWR\/EGWR02\/125-134"},{"key":"e_1_3_4_4_1","doi-asserted-by":"publisher","unstructured":"Benedikt Bitterli Chris Wyman Matt Pharr Peter Shirley Aaron Lefohn and Wojciech Jarosz. 2020. Spatiotemporal reservoir resampling for real-time ray tracing with dynamic direct lighting. ACM Trans. Graph. 39 4 Article 148 (Aug. 2020) 17\u00a0pages. doi:10.1145\/3386569.3392481","DOI":"10.1145\/3386569.3392481"},{"key":"e_1_3_4_5_1","doi-asserted-by":"publisher","unstructured":"Min-Te Chao. 1982. A general purpose unequal probability sampling plan. Biometrika 69 3 (1982) 653\u2013656. doi:10.1093\/biomet\/69.3.653","DOI":"10.1093\/biomet\/69.3.653"},{"key":"e_1_3_4_6_1","doi-asserted-by":"publisher","DOI":"10.2312\/EGGH\/HPG10\/067-075"},{"key":"e_1_3_4_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24024-4_12"},{"key":"e_1_3_4_8_1","doi-asserted-by":"publisher","unstructured":"Trevor Hedstrom Markus Kettunen Daqi Lin Chris Wyman and Tzu-Mao Li. 2025. ReSTIR BDPT: Bidirectional ReSTIR path tracing with caustics. ACM Trans. Graph. 44 5 Article 169 (Sept. 2025) 16\u00a0pages. doi:10.1145\/3744898","DOI":"10.1145\/3744898"},{"key":"e_1_3_4_9_1","doi-asserted-by":"publisher","unstructured":"Trevor Hedstrom Markus Kettunen Daqi Lin Chris Wyman and Tzu-Mao Li. 2026. Stochastic pairwise MIS for unbiased large-kernel reuse in real-time. Comput. Graph. Forum 45 2 (May 2026). doi:10.1111\/cgf.70391","DOI":"10.1111\/cgf.70391"},{"key":"e_1_3_4_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3757377.3763920"},{"key":"e_1_3_4_11_1","unstructured":"Simon Kallweit Petrik Clarberg Craig Kolb Tom\u00e1\u0161 Davidovi\u010d Kai-Hwa Yao Theresa Foley Yong He Lifan Wu Lucy Chen Tomas Akenine-M\u00f6ller Chris Wyman Cyril Crassin and Nir Benty. 2022. The Falcor rendering framework. https:\/\/github.com\/NVIDIAGameWorks\/Falcor"},{"key":"e_1_3_4_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33507-0_21"},{"key":"e_1_3_4_13_1","doi-asserted-by":"publisher","DOI":"10.2312\/sr.20241155"},{"key":"e_1_3_4_14_1","doi-asserted-by":"publisher","unstructured":"Markus Kettunen Marco Manzi Miika Aittala Jaakko Lehtinen Fr\u00e9do Durand and Matthias Zwicker. 2015. Gradient-domain path tracing. ACM Trans. Graph. 34 4 Article 123 (July 2015) 13\u00a0pages. doi:10.1145\/2766997","DOI":"10.1145\/2766997"},{"key":"e_1_3_4_15_1","unstructured":"Emmett Kilgariff Henry Moreton Nick Stam and Brandon Bell. 2018. NVIDIA Turing architecture in-depth. https:\/\/developer.nvidia.com\/blog\/nvidia-turing-architecture-in-depth\/ Accessed: 31 March 2026."},{"key":"e_1_3_4_16_1","doi-asserted-by":"publisher","unstructured":"Jaakko Lehtinen Tero Karras Samuli Laine Miika Aittala Fr\u00e9do Durand and Timo Aila. 2013. Gradient-domain Metropolis light transport. ACM Trans. Graph. 32 4 Article 95 (July 2013) 12\u00a0pages. doi:10.1145\/2461912.2461943","DOI":"10.1145\/2461912.2461943"},{"key":"e_1_3_4_17_1","doi-asserted-by":"publisher","unstructured":"Daqi Lin Markus Kettunen Benedikt Bitterli Jacopo Pantaleoni Cem Yuksel and Chris Wyman. 2022. Generalized resampled importance sampling: Foundations of ReSTIR. ACM Trans. Graph. 41 4 Article 75 (July 2022) 23\u00a0pages. doi:10.1145\/3528223.3530158","DOI":"10.1145\/3528223.3530158"},{"key":"e_1_3_4_18_1","doi-asserted-by":"publisher","unstructured":"Daqi Lin Chris Wyman and Cem Yuksel. 2021. Fast volume rendering with spatiotemporal reservoir resampling. ACM Trans. Graph. 40 6 Article 279 (Dec. 2021) 18\u00a0pages. doi:10.1145\/3478513.3480499","DOI":"10.1145\/3478513.3480499"},{"key":"e_1_3_4_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3721238.3730646"},{"key":"e_1_3_4_20_1","doi-asserted-by":"publisher","unstructured":"Marco Manzi Fabrice Rousselle Markus Kettunen Jaakko Lehtinen and Matthias Zwicker. 2014. Improved sampling for gradient-domain Metropolis light transport. ACM Trans. Graph. 33 6 Article 178 (Nov. 2014) 12\u00a0pages. doi:10.1145\/2661229.2661291","DOI":"10.1145\/2661229.2661291"},{"key":"e_1_3_4_21_1","doi-asserted-by":"publisher","unstructured":"Yaobin Ouyang Shiqiu Liu Markus Kettunen Matt Pharr and Jacopo Pantaleoni. 2021. ReSTIR GI: Path resampling for real-time path tracing. Comput. Graph. Forum 40 8 (Nov. 2021) 17\u201329. doi:10.1111\/cgf.14378","DOI":"10.1111\/cgf.14378"},{"key":"e_1_3_4_22_1","unstructured":"Martin Roberts. 2018. The unreasonable effectiveness of quasirandom sequences. https:\/\/extremelearning.com.au\/unreasonable-effectiveness-of-quasirandom-sequences\/ Accessed: 5 April 2026."},{"key":"e_1_3_4_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3721238.3730723"},{"key":"e_1_3_4_24_1","doi-asserted-by":"publisher","unstructured":"Rohan Sawhney Daqi Lin Markus Kettunen Benedikt Bitterli Ravi Ramamoorthi Chris Wyman and Matt Pharr. 2024. Decorrelating ReSTIR samplers via MCMC mutations. ACM Trans. Graph. 43 1 Article 10 (Jan. 2024) 15\u00a0pages. doi:10.1145\/3629166","DOI":"10.1145\/3629166"},{"key":"e_1_3_4_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3105762.3105770"},{"key":"e_1_3_4_26_1","doi-asserted-by":"publisher","unstructured":"Peter Shirley and Kenneth Chiu. 1997. A low distortion map between disk and square. Journal of Graphics Tools 2 3 (Jan. 1997) 45\u201352. doi:10.1080\/10867651.1997.10487479","DOI":"10.1080\/10867651.1997.10487479"},{"key":"e_1_3_4_27_1","doi-asserted-by":"publisher","DOI":"10.2312\/EGWR\/EGSR05\/139-146"},{"key":"e_1_3_4_28_1","doi-asserted-by":"publisher","unstructured":"Yusuke Tokuyoshi. 2023. Efficient spatial resampling using the PDF similarity. Proc. ACM Comput. Graph. Interact. Tech. 6 1 Article 4 (May 2023) 19\u00a0pages. doi:10.1145\/3585501","DOI":"10.1145\/3585501"},{"key":"e_1_3_4_29_1","doi-asserted-by":"publisher","unstructured":"Mirco Werner Vincent Sch\u00fc\u00dfler and Carsten Dachsbacher. 2024. ReSTIR subsurface scattering for real-time path tracing. Proc. ACM Comput. Graph. Interact. Tech. 7 3 Article 36 (Aug. 2024) 19\u00a0pages. doi:10.1145\/3675372","DOI":"10.1145\/3675372"},{"key":"e_1_3_4_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3587423.3595511"},{"key":"e_1_3_4_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3757377.3763813"},{"key":"e_1_3_4_32_1","doi-asserted-by":"publisher","unstructured":"Song Zhang Daqi Lin Markus Kettunen Cem Yuksel and Chris Wyman. 2024. Area ReSTIR: Resampling for real-time defocus and antialiasing. ACM Trans. Graph. 43 4 Article 98 (July 2024) 13\u00a0pages. doi:10.1145\/3658210","DOI":"10.1145\/3658210"}],"container-title":["Proceedings of the ACM on Computer Graphics and Interactive Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3820024","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T15:37:50Z","timestamp":1782747470000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3820024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,29]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,7,1]]}},"alternative-id":["10.1145\/3820024"],"URL":"https:\/\/doi.org\/10.1145\/3820024","relation":{},"ISSN":["2577-6193"],"issn-type":[{"value":"2577-6193","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,29]]},"assertion":[{"value":"2026-06-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}