{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T06:29:59Z","timestamp":1782282599505,"version":"3.54.5"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2014,7,27]],"date-time":"2014-07-27T00:00:00Z","timestamp":1406419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61272305"],"award-info":[{"award-number":["61272305"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Columbia Junior Faculty Startup Fund"},{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2012AA011503"],"award-info":[{"award-number":["2012AA011503"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Program for Special Support of Eminent Professionals of China"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2014,7,27]]},"abstract":"<jats:p>Realistic hair animation is a crucial component in depicting virtual characters in interactive applications. While much progress has been made in high-quality hair simulation, the overwhelming computation cost hinders similar fidelity in realtime simulations. To bridge this gap, we propose a data-driven solution. Building upon precomputed simulation data, our approach constructs a reduced model to optimally represent hair motion characteristics with a small number of guide hairs and the corresponding interpolation relationships. At runtime, utilizing such a reduced model, we only simulate guide hairs that capture the general hair motion and interpolate all rest strands. We further propose a hair correction method that corrects the resulting hair motion with a position-based model to resolve hair collisions and thus captures motion details. Our hair simulation method enables a simulation of a full head of hairs with over 150K strands in realtime. We demonstrate the efficacy and robustness of our method with various hairstyles and driven motions (e.g., head movement and wind force), and compared against full simulation results that does not appear in the training data.<\/jats:p>","DOI":"10.1145\/2601097.2601211","type":"journal-article","created":{"date-parts":[[2014,7,22]],"date-time":"2014-07-22T15:08:20Z","timestamp":1406041700000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":45,"title":["A reduced model for interactive hairs"],"prefix":"10.1145","volume":"33","author":[{"given":"Menglei","family":"Chai","sequence":"first","affiliation":[{"name":"Zhejiang University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changxi","family":"Zheng","sequence":"additional","affiliation":[{"name":"Columbia University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kun","family":"Zhou","sequence":"additional","affiliation":[{"name":"Zhejiang University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,7,27]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1409060.1409118"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/142920.134021"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00688"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360662"},{"key":"e_1_2_2_5_1","volume-title":"Proceedings of SCA, 207--213","author":"Bertails F.","unstructured":"Bertails , F. , Kim , T.-Y. , Cani , M.-P. , and Neumann , U . 2003. Adaptive wisp tree: a multiresolution control structure for simulating dynamic clustering in hair motion . In Proceedings of SCA, 207--213 . Bertails, F., Kim, T.-Y., Cani, M.-P., and Neumann, U. 2003. Adaptive wisp tree: a multiresolution control structure for simulating dynamic clustering in hair motion. In Proceedings of SCA, 207--213."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1142012"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2462012"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461912.2461962"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/545261.545273"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073368.1073389"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070781.2024173"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778845"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2421731.2421773"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00525"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2485895.2485913"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882359"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073206"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/305219.305248"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964988"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2366145.2366218"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508363.2508406"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/344779.344958"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/882262.882345"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531368"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2007.01.005"},{"key":"e_1_2_2_26_1","volume-title":"Workshop on Virtual Reality Interaction and Physical Simulation, 39--44","author":"M\u00fcller M.","unstructured":"M\u00fcller , M. , Kim , T.-Y. , and Chentanez , N . 2012. Fast simulation of inextensible hair and fur . In Workshop on Virtual Reality Interaction and Physical Simulation, 39--44 . M\u00fcller, M., Kim, T.-Y., and Chentanez, N. 2012. Fast simulation of inextensible hair and fur. In Workshop on Virtual Reality Interaction and Physical Simulation, 39--44."},{"key":"e_1_2_2_27_1","unstructured":"Petrovic L. Henne M. and Anderson J. 2005. Volumetric methods for simulation and rendering of hair. Pixar Animation Studios.  Petrovic L. Henne M. and Anderson J. 2005. Volumetric methods for simulation and rendering of hair. Pixar Animation Studios ."},{"key":"e_1_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Plante E. Cani M.-P. and Poulin P. 2001. A layered wisp model for simulating interactions inside long hair. In Computer Animation and Simulation. Springer 139--148.   Plante E. Cani M.-P. and Poulin P. 2001. A layered wisp model for simulating interactions inside long hair. In Computer Animation and Simulation . Springer 139--148.","DOI":"10.1007\/978-3-7091-6240-8_13"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/vis.4340020410"},{"key":"e_1_2_2_30_1","first-page":"11","article-title":"QL: A Fortran code for convex quadratic programming-user's guide","volume":"2","author":"Schittkowski K.","year":"2005","unstructured":"Schittkowski , K. 2005 . QL: A Fortran code for convex quadratic programming-user's guide , Version 2 . 11 . Report, Department of Mathematics, University of Bayreuth. Schittkowski, K. 2005. QL: A Fortran code for convex quadratic programming-user's guide, Version 2.11. Report, Department of Mathematics, University of Bayreuth.","journal-title":"Version"},{"key":"e_1_2_2_31_1","volume-title":"Low rank updates for the Cholesky decomposition","author":"Seeger M.","unstructured":"Seeger , M. 2007. Low rank updates for the Cholesky decomposition . University of California at Berkeley , Tech. Rep. Seeger, M. 2007. Low rank updates for the Cholesky decomposition. University of California at Berkeley, Tech. Rep."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360612.1360663"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401032.1401080"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1141911.1141962"},{"key":"e_1_2_2_35_1","volume-title":"Approximation Algorithms","author":"Vazirani V. V.","unstructured":"Vazirani , V. V. 2001. Approximation Algorithms . Springer . Vazirani, V. V. 2001. Approximation Algorithms. Springer."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/545261.545283"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964966"},{"key":"e_1_2_2_38_1","volume-title":"Proceedings of Pacific Graphics, 234--243","author":"Ward K.","unstructured":"Ward , K. , and Lin , M. C . 2003. Adaptive grouping and subdivision for simulating hair dynamics . In Proceedings of Pacific Graphics, 234--243 . Ward, K., and Lin, M. C. 2003. Adaptive grouping and subdivision for simulating hair dynamics. In Proceedings of Pacific Graphics, 234--243."},{"key":"e_1_2_2_39_1","volume-title":"Proceedings of Computer Animation and Social Agents, 41--47","author":"Ward K.","unstructured":"Ward , K. , Lin , M. C. , Joohi , L. , Fisher , S. , and Macri , D . 2003. Modeling hair using level-of-detail representations . In Proceedings of Computer Animation and Social Agents, 41--47 . Ward, K., Lin, M. C., Joohi, L., Fisher, S., and Macri, D. 2003. Modeling hair using level-of-detail representations. In Proceedings of Computer Animation and Social Agents, 41--47."},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.30"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531345"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2601097.2601211","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2601097.2601211","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:23Z","timestamp":1750231163000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2601097.2601211"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,27]]},"references-count":41,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,7,27]]}},"alternative-id":["10.1145\/2601097.2601211"],"URL":"https:\/\/doi.org\/10.1145\/2601097.2601211","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,27]]},"assertion":[{"value":"2014-07-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}