{ "status": "ok", "message-type": "work", "message-version": "1.0.0", "message": { "indexed": { "date-parts": [ [ 2020, 4, 4 ] ], "date-time": "2020-04-04T12:11:20Z", "timestamp": 1586002280725 }, "reference-count": 40, "publisher": "Association for Computing Machinery (ACM)", "issue": "4", "license": [ { "URL": "http://www.acm.org/publications/policies/copyright_policy#Background", "start": { "date-parts": [ [ 2014, 7, 27 ] ], "date-time": "2014-07-27T00:00:00Z", "timestamp": 1406419200000 }, "delay-in-days": 0, "content-version": "vor" } ], "funder": [ { "DOI": "10.13039/501100001809", "name": "National Natural Science Foundation of China", "doi-asserted-by": "publisher", "award": [ "61272305" ] }, { "DOI": "10.13039/100002418", "name": "Intel Corporation", "doi-asserted-by": "publisher", "award": [] }, { "DOI": "10.13039/501100002855", "name": "Ministry of Science and Technology of the People's Republic of China", "doi-asserted-by": "publisher", "award": [ "2012AA011503" ] }, { "name": "Columbia Junior Faculty Startup Fund", "award": [] }, { "name": "National Program for Special Support of Eminent Professionals of China", "award": [] } ], "content-domain": { "domain": [], "crossmark-restriction": false }, "short-container-title": [ "ACM Trans. Graph." ], "published-print": { "date-parts": [ [ 2014, 7, 27 ] ] }, "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", "source": "Crossref", "is-referenced-by-count": 21, "title": [ "A reduced model for interactive hairs" ], "prefix": "10.1145", "volume": "33", "author": [ { "given": "Menglei", "family": "Chai", "sequence": "first", "affiliation": [ { "name": "Zhejiang University" } ] }, { "given": "Changxi", "family": "Zheng", "sequence": "additional", "affiliation": [ { "name": "Columbia University" } ] }, { "given": "Kun", "family": "Zhou", "sequence": "additional", "affiliation": [ { "name": "Zhejiang University" } ] } ], "member": "320", "reference": [ { "key": "e_1_2_2_1_1", "DOI": "10.1145/1409060.1409118", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_2_1", "DOI": "10.1145/142920.134021", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_3_1", "DOI": "10.1111/1467-8659.00688", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_4_1", "DOI": "10.1145/1360612.1360662", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_5_1", "author": "Bertails F.", "volume-title": "Proceedings of SCA, 207--213" }, { "key": "e_1_2_2_6_1", "DOI": "10.1145/1141911.1142012", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_7_1", "DOI": "10.1145/2461912.2462012", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_8_1", "DOI": "10.1145/2461912.2461962", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_9_1", "DOI": "10.1145/545261.545273", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_10_1", "DOI": "10.1145/1073368.1073389", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_11_1", "DOI": "10.1145/2070781.2024173", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_12_1", "DOI": "10.1145/1778765.1778845", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_13_1", "DOI": "10.5555/2421731.2421773", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_14_1", "DOI": "10.1111/1467-8659.00525", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_15_1", "DOI": "10.1145/2485895.2485913", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_16_1", "DOI": "10.1145/882262.882359", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_17_1", "DOI": "10.1145/1073204.1073206", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_18_1", "unstructured": "Karypis G. and Kumar V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing 20 1 359--392. 10.1137/S1064827595287997 Karypis G. and Kumar V. 1998. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing 20 1 359--392. 10.1137/S1064827595287997", "DOI": "10.1137/S1064827595287997", "doi-asserted-by": "crossref" }, { "key": "e_1_2_2_19_1", "DOI": "10.1145/2010324.1964988", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_20_1", "DOI": "10.1145/2366145.2366218", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_21_1", "DOI": "10.1145/2508363.2508406", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_22_1", "DOI": "10.1145/344779.344958", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_23_1", "DOI": "10.1145/882262.882345", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_24_1", "DOI": "10.1145/1531326.1531368", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_25_1", "DOI": "10.1016/j.jvcir.2007.01.005", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_26_1", "author": "M\u00fcller M.", "volume-title": "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", "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", "doi-asserted-by": "crossref" }, { "key": "e_1_2_2_29_1", "DOI": "10.1002/vis.4340020410", "doi-asserted-by": "publisher" }, { "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", "journal-title": "Version" }, { "key": "e_1_2_2_32_1", "DOI": "10.1145/1360612.1360663", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_33_1", "DOI": "10.1145/1401032.1401080", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_34_1", "DOI": "10.1145/1141911.1141962", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_35_1", "unstructured": "Vazirani V. V. 2001. Approximation Algorithms. Springer. Vazirani V. V. 2001. Approximation Algorithms . Springer." }, { "key": "e_1_2_2_36_1", "DOI": "10.1145/545261.545283", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_37_1", "DOI": "10.1145/2010324.1964966", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_38_1", "author": "Ward K.", "volume-title": "Proceedings of Pacific Graphics, 234--243" }, { "key": "e_1_2_2_39_1", "author": "Ward K.", "volume-title": "Proceedings of Computer Animation and Social Agents, 41--47" }, { "key": "e_1_2_2_40_1", "DOI": "10.1109/TVCG.2007.30", "doi-asserted-by": "publisher" }, { "key": "e_1_2_2_41_1", "DOI": "10.1145/1531326.1531345", "doi-asserted-by": "publisher" } ], "container-title": [ "ACM Transactions on Graphics" ], "original-title": [], "language": "en", "link": [ { "URL": "http://dl.acm.org/ft_gateway.cfm?id=2601211&ftid=1488933&dwn=1", "content-type": "unspecified", "content-version": "vor", "intended-application": "similarity-checking" } ], "deposited": { "date-parts": [ [ 2020, 4, 4 ] ], "date-time": "2020-04-04T11:57:57Z", "timestamp": 1586001477000 }, "score": 1.0, "subtitle": [], "short-title": [], "issued": { "date-parts": [ [ 2014, 7, 27 ] ] }, "references-count": 40, "journal-issue": { "published-print": { "date-parts": [ [ 2014, 7, 27 ] ] }, "issue": "4" }, "alternative-id": [ "10.1145/2601097.2601211" ], "URL": "http://dx.doi.org/10.1145/2601097.2601211", "relation": { "cites": [] }, "ISSN": [ "0730-0301", "1557-7368" ], "issn-type": [ { "value": "0730-0301", "type": "print" }, { "value": "1557-7368", "type": "electronic" } ] } }