{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T08:15:59Z","timestamp":1774685759605,"version":"3.50.1"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2010,7,26]],"date-time":"2010-07-26T00:00:00Z","timestamp":1280102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2009CB320801"],"award-info":[{"award-number":["2009CB320801"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["60825201"],"award-info":[{"award-number":["60825201"]}],"id":[{"id":"10.13039\/501100001809","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":[[2010,7,26]]},"abstract":"<jats:p>\n            We present an algorithm for interactive hair rendering with both single and multiple scattering effects under complex environment lighting. The outgoing radiance due to single scattering is determined by the integral of the product of the environment lighting, the scattering function, and the transmittance that accounts for self-shadowing among hair fibers. We approximate the environment light by a set of spherical radial basis functions (SRBFs) and thus convert the outgoing radiance integral into the sum of radiance contributions of all SRBF lights. For each SRBF light, we factor out the effective transmittance to represent the radiance integral as the product of two terms: the transmittance and the convolution of the SRBF light and the scattering function. Observing that the convolution term is independent of the hair geometry, we precompute it for commonly-used scattering models, and reduce the run-time computation to table lookups. We further propose a technique, called the\n            <jats:italic>convolution optical depth map<\/jats:italic>\n            , to efficiently approximate the effective transmittance by filtering the optical depth maps generated at the center of the SRBF using a depth-dependent kernel. As for the multiple scattering computation, we handle SRBF lights by using similar factorization and precomputation schemes, and adopt sparse sampling and interpolation to speed up the computation. Compared to off-line algorithms, our algorithm can generate images of comparable quality, but at interactive frame rates.\n          <\/jats:p>","DOI":"10.1145\/1778765.1778792","type":"journal-article","created":{"date-parts":[[2010,7,15]],"date-time":"2010-07-15T12:48:46Z","timestamp":1279198126000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Interactive hair rendering under environment lighting"],"prefix":"10.1145","volume":"29","author":[{"given":"Zhong","family":"Ren","sequence":"first","affiliation":[{"name":"Zhejiang University and Microsoft Research Asia"}]},{"given":"Kun","family":"Zhou","sequence":"additional","affiliation":[{"name":"Zhejiang University"}]},{"given":"Tengfei","family":"Li","sequence":"additional","affiliation":[{"name":"Zhejiang University"}]},{"given":"Wei","family":"Hua","sequence":"additional","affiliation":[{"name":"Zhejiang University"}]},{"given":"Baining","family":"Guo","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia"}]}],"member":"320","published-online":{"date-parts":[[2010,7,26]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882314"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360633"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276476"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1187112.1187153"},{"key":"e_1_2_2_5_1","unstructured":"Harris M. Sengupta S. and Owens J. 2007. Parallel prefix sum (scan) in CUDA. GPU Gems 3 Chapter 39.  Harris M. Sengupta S. and Owens J. 2007. Parallel prefix sum (scan) in CUDA. GPU Gems 3 Chapter 39."},{"key":"e_1_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Hensley J. Scheuermann T. Coombe G. Singh M. and Lastra A. 2005. Fast summed-area table generation and its applications. Computer Graphics Forum 547--555.  Hensley J. Scheuermann T. Coombe G. Singh M. and Lastra A. 2005. Fast summed-area table generation and its applications. Computer Graphics Forum 547--555.","DOI":"10.1111\/j.1467-8659.2005.00880.x"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/74333.74361"},{"key":"e_1_2_2_8_1","volume-title":"Eurographics Workshop on Rendering, 177--182","author":"Kim T.-Y.","unstructured":"Kim , T.-Y. , and Neumann , U . 2001. Opacity shadow maps . In Eurographics Workshop on Rendering, 177--182 . Kim, T.-Y., and Neumann, U. 2001. Opacity shadow maps. In Eurographics Workshop on Rendering, 177--182."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344958"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882345"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1186223.1186278"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141995"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360630"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882280"},{"key":"e_1_2_2_15_1","unstructured":"NVIDIA 2007. CUDA homepage. http:\/\/developer.nvidia.com\/object\/cuda.html.  NVIDIA 2007. CUDA homepage. http:\/\/developer.nvidia.com\/object\/cuda.html."},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383317"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1342250.1342275"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1507149.1507160"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/566570.566612"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141981"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.30"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2008.01165.x"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.43"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360631"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1778765.1778792","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1778765.1778792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:25:53Z","timestamp":1750278353000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1778765.1778792"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,26]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,7,26]]}},"alternative-id":["10.1145\/1778765.1778792"],"URL":"https:\/\/doi.org\/10.1145\/1778765.1778792","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,26]]},"assertion":[{"value":"2010-07-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}