{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T02:13:38Z","timestamp":1774059218748,"version":"3.50.1"},"reference-count":42,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ontario Early Researchers Award","award":["ER19-15-034"],"award-info":[{"award-number":["ER19-15-034"]}]},{"DOI":"10.13039\/501100001804","name":"Canada Research Chairs Program","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001804","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100026024","name":"Adobe Research","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100026024","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100004675","name":"Autodesk","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100004675","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007224","name":"Connaught Fund","doi-asserted-by":"crossref","award":["503114"],"award-info":[{"award-number":["503114"]}],"id":[{"id":"10.13039\/501100007224","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","award":["RGPIN-2017-05524"],"award-info":[{"award-number":["RGPIN-2017-05524"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Graph."],"published-print":{"date-parts":[[2022,7]]},"abstract":"<jats:p>We present a new method for computing a smooth minimum distance function based on the LogSumExp function for point clouds, edge meshes, triangle meshes, and combinations of all three. We derive blending weights and a modified Barnes-Hut acceleration approach that ensure our method approximates the true distance, and is conservative (points outside the zero isosurface are guaranteed to be outside the surface) and efficient to evaluate for all the above data types. This, in combination with its ability to smooth sparsely sampled and noisy data, like point clouds, shortens the gap between data acquisition and simulation, and thereby enables new applications such as direct, co-dimensional rigid body simulation using unprocessed lidar data.<\/jats:p>","DOI":"10.1145\/3528223.3530093","type":"journal-article","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T21:06:27Z","timestamp":1658523987000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Fast evaluation of smooth distance constraints on co-dimensional geometry"],"prefix":"10.1145","volume":"41","author":[{"given":"Abhishek","family":"Madan","sequence":"first","affiliation":[{"name":"University of Toronto, Canada"}]},{"given":"David I. W.","family":"Levin","sequence":"additional","affiliation":[{"name":"University of Toronto, Canada"}]}],"member":"320","published-online":{"date-parts":[[2022,7,22]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2003.1175093"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201337"},{"key":"e_1_2_2_3_1","volume-title":"A hierarchical O (N log N) force-calculation algorithm. nature 324, 6096","author":"Barnes Josh","year":"1986","unstructured":"Josh Barnes and Piet Hut. 1986. A hierarchical O (N log N) force-calculation algorithm. nature 324, 6096 (1986), 446--449."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cad.2012.10.035"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/383259.383266"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00609"},{"key":"e_1_2_2_7_1","unstructured":"Erwin Coumans and Yunfei Bai. 2016--2021. PyBullet a Python module for physics simulation for games robotics and machine learning. http:\/\/pybullet.org."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3131280"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450626.3459757"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450626.3459802"},{"key":"e_1_2_2_11_1","unstructured":"Ga\u00ebl Guennebaud Beno\u00eet Jacob et al. 2010. Eigen v3. http:\/\/eigen.tuxfamily.org."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02256-2_9"},{"key":"e_1_2_2_13_1","first-page":"94","article-title":"Sensitivity analysis in convex quadratic optimization: simultaneous perturbation of the objective and right-hand-side vectors","volume":"2","author":"Hadigheh Alireza Ghaffari","year":"2007","unstructured":"Alireza Ghaffari Hadigheh, Oleksandr Romanko, and Tam\u00e1s Terlaky. 2007. Sensitivity analysis in convex quadratic optimization: simultaneous perturbation of the objective and right-hand-side vectors. Algorithmic Operations Research 2, 2 (2007), 94--94.","journal-title":"Algorithmic Operations Research"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2461217.2461219"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003710050084"},{"key":"e_1_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Alec Jacobson Daniele Panozzo et al. 2018. libigl: A simple C++ geometry processing library. https:\/\/libigl.github.io\/.","DOI":"10.1145\/3134472.3134497"},{"key":"e_1_2_2_17_1","volume-title":"On the cost of floating-point computation without extra-precise arithmetic. World-Wide Web document","author":"Kahan William","year":"2004","unstructured":"William Kahan. 2004. On the cost of floating-point computation without extra-precise arithmetic. World-Wide Web document (2004), 21."},{"key":"e_1_2_2_18_1","volume-title":"Proceedings of the fourth Eurographics symposium on Geometry processing","volume":"7","author":"Kazhdan Michael","year":"2006","unstructured":"Michael Kazhdan, Matthew Bolitho, and Hugues Hoppe. 2006. Poisson surface reconstruction. In Proceedings of the fourth Eurographics symposium on Geometry processing, Vol. 7."},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487228.2487237"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-6670(17)65584-8"},{"key":"e_1_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Lei Lan Yin Yang Danny M. Kaufman Junfeng Yao Minchen Li and Chenfanfu Jiang. 2021. Medial IPC: Accelerated Incremental Potential Contact With Medial Elastics. ACM Trans. Graph. (2021).","DOI":"10.1145\/3450626.3459753"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392425"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3386569.3392425"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3450626.3459767"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3384538"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2994258.2994272"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2010324.1964932"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00459"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2816795.2818100"},{"key":"e_1_2_2_30_1","volume-title":"Wright","author":"Nocedal Jorge","year":"2006","unstructured":"Jorge Nocedal and Stephen J. Wright. 2006. Numerical Optimization (2e ed.). Springer, New York, NY, USA."},{"key":"e_1_2_2_31_1","unstructured":"NVIDIA. 2021. NVIDIA PhysX SDK. https:\/\/developer.nvidia.com\/physx-sdk."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3072959.3073649"},{"key":"e_1_2_2_33_1","volume-title":"DeepSDF: Learning Continuous Signed Distance Functions for Shape Representation. In The IEEE Conference on Computer Vision and Pattern Recognition (CVPR).","author":"Park Jeong Joon","year":"2019","unstructured":"Jeong Joon Park, Peter Florence, Julian Straub, Richard Newcombe, and Steven Love-grove. 2019. DeepSDF: Learning Continuous Signed Distance Functions for Shape Representation. In The IEEE Conference on Computer Vision and Pattern Recognition (CVPR)."},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1015706.1015773"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499370.2462176"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6247676"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766947"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00365"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3439429"},{"key":"e_1_2_2_40_1","volume-title":"Smola","author":"Zhang Aston","year":"2020","unstructured":"Aston Zhang, Zachary C. Lipton, Mu Li, and Alexander J. Smola. 2020. Dive into Deep Learning. https:\/\/d2l.ai."},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/832286.835639"},{"key":"e_1_2_2_42_1","first-page":"3D","article-title":"Thingi10K","volume":"10","author":"Zhou Qingnan","year":"2016","unstructured":"Qingnan Zhou and Alec Jacobson. 2016. Thingi10K: A Dataset of 10,000 3D-Printing Models. arXiv preprint arXiv:1605.04797 (2016).","journal-title":"A Dataset of"}],"container-title":["ACM Transactions on Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528223.3530093","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3528223.3530093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:26Z","timestamp":1750186946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3528223.3530093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["10.1145\/3528223.3530093"],"URL":"https:\/\/doi.org\/10.1145\/3528223.3530093","relation":{},"ISSN":["0730-0301","1557-7368"],"issn-type":[{"value":"0730-0301","type":"print"},{"value":"1557-7368","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7]]},"assertion":[{"value":"2022-07-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}