{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T19:25:15Z","timestamp":1783106715658,"version":"3.54.6"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"4","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972194"],"award-info":[{"award-number":["61972194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62032011"],"award-info":[{"award-number":["62032011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20211147"],"award-info":[{"award-number":["BK20211147"]}],"id":[{"id":"10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2025,8,1]]},"abstract":"<jats:p>Systematically simulating specular light transport requires an exhaustive search for triangle tuples containing admissible paths. Given the extreme inefficiency of enumerating all combinations, we significantly reduce the search domain by stochastically sampling such tuples. The challenge is to design proper sampling probabilities that keep the noise level controllable. Our key insight is that by bounding the irradiance contributed by each triangle tuple at a given position, we can sample a subset of triangle tuples with potentially high contributions. Although low-contribution tuples are assigned a negligible probability, the overall variance remains low.<\/jats:p>\n                  <jats:p>Therefore, we derive position and irradiance bounds for caustics casted by each triangle tuple, introducing a bounding property of rational functions on a Bernstein basis. When formulating position and irradiance expressions into rational functions, we handle non-rational parts through remainder variables to maintain bounding validity. Finally, we carefully design the sampling probabilities by optimizing the upper bound of the variance, expressed only using the position and irradiance bounds.<\/jats:p>\n                  <jats:p>The bound-driven sampling of triangle tuples is intrinsically unbiased even without defensive sampling. It can be combined with various unbiased and biased root-finding techniques within a local triangle domain. Extensive evaluations show that our method enables the fast and reliable rendering of complex caustics effects. Yet, our method is efficient for no more than two specular vertices, where complexity grows sublinearly to the number of triangles and linearly to that of emitters, and does not consider the Fresnel and visibility terms. We also rely on parameters to control subdivisions.<\/jats:p>","DOI":"10.1145\/3731145","type":"journal-article","created":{"date-parts":[[2025,7,27]],"date-time":"2025-07-27T04:02:22Z","timestamp":1753588942000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Bernstein Bounds for Caustics"],"prefix":"10.1145","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-6620-1900","authenticated-orcid":false,"given":"Zhimin","family":"Fan","sequence":"first","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1783-818X","authenticated-orcid":false,"given":"Chen","family":"Wang","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6212-4224","authenticated-orcid":false,"given":"Yiming","family":"Wang","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9447-2438","authenticated-orcid":false,"given":"Boxuan","family":"Li","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5100-7076","authenticated-orcid":false,"given":"Yuxuan","family":"Guo","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9379-094X","authenticated-orcid":false,"given":"Ling-Qi","family":"Yan","sequence":"additional","affiliation":[{"name":"University of California Santa Barbara, Santa Barbara, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7605-5206","authenticated-orcid":false,"given":"Yanwen","family":"Guo","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4176-7617","authenticated-orcid":false,"given":"Jie","family":"Guo","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,7,27]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/192161.192250"},{"key":"e_1_2_2_2_1","volume-title":"D\u00e9moistration du th\u00e9or\u00e9me de Weierstrass fond\u00e9e sur le calcul des probabilit\u00e9s. Communications de la Soci\u00e9t\u00e9 math\u00e9matique de Kharkow. 2-\u00e9e s\u00e9rie 13, 1","author":"Bernstein S.","year":"1912","unstructured":"S. Bernstein. 1912. D\u00e9moistration du th\u00e9or\u00e9me de Weierstrass fond\u00e9e sur le calcul des probabilit\u00e9s. Communications de la Soci\u00e9t\u00e9 math\u00e9matique de Kharkow. 2-\u00e9e s\u00e9rie 13, 1 (1912), 1\u20132."},{"key":"e_1_2_2_3_1","unstructured":"Benedikt Bitterli. 2016. Rendering resources. https:\/\/benedikt-bitterli.me\/resources\/."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/380666.380670"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3587423.3595519"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658132"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618360"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2012.03.001"},{"key":"e_1_2_2_9_1","volume-title":"Interval Mathematics","author":"Garloff J.","year":"1985","unstructured":"J. Garloff. 1986. Convergent bounds for the range of multivariate polynomials. In Interval Mathematics 1985, Karl Nickel (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 37\u201356."},{"key":"e_1_2_2_10_1","volume-title":"Smith","author":"Garloff J\u00fcrgen","year":"2012","unstructured":"J\u00fcrgen Garloff, Antek Schabert, and Andrew P. Smith. 2012. Bounds on the Range of Multivariate Rational Functions. PAMM 12 (2012)."},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366211"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1618452.1618487"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2858834.2858844"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/964965.808588"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.t01-2-00708"},{"key":"e_1_2_2_16_1","unstructured":"Wenzel Jakob. 2010. Mitsuba renderer. http:\/\/www.mitsuba-renderer.org."},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2185520.2185554"},{"key":"e_1_2_2_18_1","volume-title":"Rendering Techniques '95, Patrick M","author":"Jensen Henrik Wann","unstructured":"Henrik Wann Jensen. 1995. Importance Driven Path Tracing Using the Photon Map. In Rendering Techniques '95, Patrick M. Hanrahan and Werner Purgathofer (Eds.). Springer Vienna, Vienna, 326\u2013335."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0097-8493(94)00145-O"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/15922.15902"},{"key":"e_1_2_2_21_1","volume-title":"Kaplanyan and Carsten Dachsbacher","author":"Anton","year":"2013","unstructured":"Anton S. Kaplanyan and Carsten Dachsbacher. 2013. Path Space Regularization for Holistic and Robust Light Transport. Computer Graphics Forum 32, 2pt1 (2013), 63\u201372."},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601108"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3414685.3417811"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/133994.134082"},{"key":"e_1_2_2_25_1","first-page":"1","article-title":"Fast, Minimum Storage Ray-Triangle Intersection","volume":"2","author":"M\u00f6ller Tomas","year":"1997","unstructured":"Tomas M\u00f6ller and Ben Trumbore. 1997. Fast, Minimum Storage Ray-Triangle Intersection. Journal of Graphics Tools 2, 1 (Jan. 1997), 21\u201328.","journal-title":"Journal of Graphics Tools"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13227"},{"key":"e_1_2_2_27_1","first-page":"34","article-title":"Bounding the Range of a Rational Function over a box","volume":"17","author":"Narkawicz Anthony","year":"2012","unstructured":"Anthony Narkawicz, J\u00fcrgen Garloff, Andrew P. Smith, and C\u00e9sar A. Mu\u00f1oz. 2012. Bounding the Range of a Rational Function over a box. Reliable Computing 17 (2012), 34\u201339.","journal-title":"Reliable Computing"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392441"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/37401.37408"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2980179.2982411"},{"key":"e_1_2_2_31_1","volume-title":"Robust Monte Carlo Methods for Light Transport Simulation. Ph. D. Dissertation","author":"Veach Eric","unstructured":"Eric Veach. 1998. Robust Monte Carlo Methods for Light Transport Simulation. Ph. D. Dissertation. Stanford University, Stanford, CA, USA. Advisor(s) Guibas, Leonidas J. AAI9837162."},{"key":"e_1_2_2_32_1","volume-title":"Bidirectional Estimators for Light Transport","author":"Veach Eric","unstructured":"Eric Veach and Leonidas Guibas. 1995. Bidirectional Estimators for Light Transport. In Photorealistic Rendering Techniques, Georgios Sakas, Stefan M\u00fcller, and Peter Shirley (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 145\u2013167."},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/258734.258775"},{"key":"e_1_2_2_34_1","volume-title":"Article 18","author":"Vorba Ji\u0159\u00ed","year":"2019","unstructured":"Ji\u0159\u00ed Vorba, Johannes Hanika, Sebastian Herholz, Thomas M\u00fcller, Jaroslav K\u0159iv\u00e5nek, and Alexander Keller. 2019. Path Guiding in Production., Article 18 (2019), 77 pages."},{"key":"e_1_2_2_35_1","volume-title":"Single Scattering in Refractive Media with Triangle Mesh Boundaries. ACM SIGGRAPH 2009 papers (July","author":"Walter Bruce","year":"2009","unstructured":"Bruce Walter, Shuang Zhao, Nicolas Holzschuch, and Kavita Bala. 2009. Single Scattering in Refractive Media with Triangle Mesh Boundaries. ACM SIGGRAPH 2009 papers (July 2009), 1\u20138."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3414685.3417792"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/97879.97920"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392408"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3731145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T17:57:21Z","timestamp":1774634241000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3731145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,27]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8,1]]}},"alternative-id":["10.1145\/3731145"],"URL":"https:\/\/doi.org\/10.1145\/3731145","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,27]]},"assertion":[{"value":"2025-07-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}