{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T08:15:52Z","timestamp":1774685752216,"version":"3.50.1"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2018YFB1403900"],"award-info":[{"award-number":["2018YFB1403900"]}],"id":[{"id":"10.13039\/501100012166","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":[[2021,12]]},"abstract":"<jats:p>We propose a new algorithm for updating a Cholesky factorization which speeds up Projective Dynamics simulations with topological changes. Our approach addresses an important limitation of the original Projective Dynamics, i.e., that topological changes such as cutting, fracturing, or tearing require full refactorization which compromises computation speed, especially in real-time applications. Our method progressively modifies the Cholesky factor of the system matrix in the global step instead of computing it from scratch. Only a small amount of overhead is added since most of the topological changes in typical simulations are continuous and gradual. Our method is based on the update and downdate routine in CHOLMOD, but unlike recent related work, supports dynamic sizes of the system matrix and the addition of new vertices. Our approach allows us to introduce clean cuts and perform interactive remeshing. Our experiments show that our method works particularly well in simulation scenarios involving cutting, tearing, and local remeshing operations.<\/jats:p>","DOI":"10.1145\/3478513.3480505","type":"journal-article","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T18:29:20Z","timestamp":1639160960000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Interactive cutting and tearing in projective dynamics with progressive cholesky updates"],"prefix":"10.1145","volume":"40","author":[{"given":"Jing","family":"Li","sequence":"first","affiliation":[{"name":"University of Utah"}]},{"given":"Tiantian","family":"Liu","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, China"}]},{"given":"Ladislav","family":"Kavan","sequence":"additional","affiliation":[{"name":"University of Utah"}]},{"given":"Baoquan","family":"Chen","sequence":"additional","affiliation":[{"name":"Peking University, China"}]}],"member":"320","published-online":{"date-parts":[[2021,12,10]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCG.2017.45"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601116"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201387"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391989.1391995"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392486"},{"key":"e_1_2_2_6_1","volume-title":"Sparse matrices and their applications","author":"Cuthill Elizabeth","unstructured":"Elizabeth Cuthill . 1972. Several strategies for reducing the bandwidth of matrices . In Sparse matrices and their applications . Springer , 157--166. Elizabeth Cuthill. 1972. Several strategies for reducing the bandwidth of matrices. In Sparse matrices and their applications. Springer, 157--166."},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1196434"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479897321076"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089547980343641X"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1462173.1462176"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492916000076"},{"key":"e_1_2_2_12_1","volume-title":"DiffPD: Differentiable Projective Dynamics with Contact. arXiv preprint arXiv:2101.05917","author":"Du Tao","year":"2021","unstructured":"Tao Du , Kui Wu , Pingchuan Ma , Sebastien Wah , Andrew Spielberg , Daniela Rus , and Wojciech Matusik . 2021. DiffPD: Differentiable Projective Dynamics with Contact. arXiv preprint arXiv:2101.05917 ( 2021 ). Tao Du, Kui Wu, Pingchuan Ma, Sebastien Wah, Andrew Spielberg, Daniela Rus, and Wojciech Matusik. 2021. DiffPD: Differentiable Projective Dynamics with Contact. arXiv preprint arXiv:2101.05917 (2021)."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3306131.3317019"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2980179.2982437"},{"key":"e_1_2_2_15_1","volume-title":"Methods for modifying matrix factorizations. Mathematics of computation 28, 126","author":"Gill Philip E","year":"1974","unstructured":"Philip E Gill , Gene H Golub , Walter Murray , and Michael A Saunders . 1974. Methods for modifying matrix factorizations. Mathematics of computation 28, 126 ( 1974 ), 505--535. Philip E Gill, Gene H Golub, Walter Murray, and Michael A Saunders. 1974. Methods for modifying matrix factorizations. Mathematics of computation 28, 126 (1974), 505--535."},{"key":"e_1_2_2_16_1","volume-title":"Tearing of membranes for interactive real-time surgical training. Studies in health technology and informatics 111","author":"Grimm Johannes","year":"2005","unstructured":"Johannes Grimm . 2005. Tearing of membranes for interactive real-time surgical training. Studies in health technology and informatics 111 ( 2005 ), 153--159. Johannes Grimm. 2005. Tearing of membranes for interactive real-time surgical training. Studies in health technology and informatics 111 (2005), 153--159."},{"key":"e_1_2_2_17_1","unstructured":"Halfbrick Studios. 2010. Fruit Ninja. https:\/\/apps.apple.com\/us\/app\/fruit-ninja\/id403858572  Halfbrick Studios. 2010. Fruit Ninja. https:\/\/apps.apple.com\/us\/app\/fruit-ninja\/id403858572"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2231816.2231821"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3272127.3275107"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3414685.3417828"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/166117.166119"},{"key":"e_1_2_2_22_1","unstructured":"M Intel. 2007. Intel math kernel library. (2007).  M Intel. 2007. Intel math kernel library. (2007)."},{"key":"e_1_2_2_23_1","unstructured":"George Karypis and Vipin Kumar. 2009. MeTis: Unstructured Graph Partitioning and Sparse Matrix Ordering System Version 4.0. http:\/\/www.cs.umn.edu\/~metis.  George Karypis and Vipin Kumar. 2009. MeTis: Unstructured Graph Partitioning and Sparse Matrix Ordering System Version 4.0. http:\/\/www.cs.umn.edu\/~metis."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3203203"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3359566.3360073"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3309486.3340249"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.3010236"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0614019"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2990496"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3379599"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964932"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2982818.2982822"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2017.2730875"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818081"},{"key":"e_1_2_2_35_1","volume-title":"Sparse Matrix Computations","author":"Tarjan Robert Endre","unstructured":"Robert Endre Tarjan . 1976. Graph theory and Gaussian elimination . In Sparse Matrix Computations . Elsevier , 3--22. Robert Endre Tarjan. 1976. Graph theory and Gaussian elimination. In Sparse Matrix Computations. Elsevier, 3--22."},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818063"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/2849517.2849531"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12528"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3355089.3356486"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2856317"},{"key":"e_1_2_2_41_1","volume-title":"AMPS: A Real-time Mesh Cutting Algorithm for Surgical Simulations. arXiv preprint arXiv:1811.00328","author":"Yeung Yu-Hong","year":"2018","unstructured":"Yu-Hong Yeung , Alex Pothen , and Jessica Crouch . 2018 . AMPS: A Real-time Mesh Cutting Algorithm for Surgical Simulations. arXiv preprint arXiv:1811.00328 (2018). Yu-Hong Yeung, Alex Pothen, and Jessica Crouch. 2018. AMPS: A Real-time Mesh Cutting Algorithm for Surgical Simulations. arXiv preprint arXiv:1811.00328 (2018)."}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3478513.3480505","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3478513.3480505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:49Z","timestamp":1750191109000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3478513.3480505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":41,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["10.1145\/3478513.3480505"],"URL":"https:\/\/doi.org\/10.1145\/3478513.3480505","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"2021-12-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}