{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:01:04Z","timestamp":1760241664212,"version":"build-2065373602"},"reference-count":6,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T00:00:00Z","timestamp":1531353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Computation of the distance between point and triangle in 3D is a common task in numerical analysis. The input values of the algorithm are coordinates of three points of the triangle and one point from which the distance is determined. An existing algorithm is extended to compute the gradient and the Hessian of that distance with respect to coordinates of involved points. Derivation of exact expressions for gradient and Hessian is presented, and numerical accuracy is evaluated for various cases. The algorithm has O(1) time and space complexity. The included open-source code may be used in applications where derivatives of point-triangle distance are required.<\/jats:p>","DOI":"10.3390\/a11070104","type":"journal-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T11:19:24Z","timestamp":1531394364000},"page":"104","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Gradient and the Hessian of the Distance between Point and Triangle in 3D"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3675-726X","authenticated-orcid":false,"given":"Igor","family":"Gribanov","sequence":"first","affiliation":[{"name":"Faculty of Engineering and Applied Science, Memorial University of Newfoundland, 40 Arctic Ave, St. John\u2019s, NL A1B 3X7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rocky","family":"Taylor","sequence":"additional","affiliation":[{"name":"Faculty of Engineering and Applied Science, Memorial University of Newfoundland, 40 Arctic Ave, St. John\u2019s, NL A1B 3X7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Sarracino","sequence":"additional","affiliation":[{"name":"Faculty of Engineering and Applied Science, Memorial University of Newfoundland, 40 Arctic Ave, St. John\u2019s, NL A1B 3X7, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,7,12]]},"reference":[{"key":"ref_1","unstructured":"Eberly, D. (2018, July 09). Distance between Point and Triangle in 3D. Available online: https:\/\/www.geometrictools.com\/Documentation\/DistancePoint3Triangle3.pdf.pdf."},{"key":"ref_2","unstructured":"Laursen, T.A. (2013). Computational Contact and Impact Mechanics: Fundamentals of Modeling Interfacial Phenomena in Nonlinear Finite Element Analysis, Springer Science & Business Media."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1145\/2601097.2601132","article-title":"Adaptive tearing and cracking of thin sheets","volume":"33","author":"Pfaff","year":"2014","journal-title":"ACM Trans. Graph."},{"key":"ref_4","unstructured":"Fisher, S., and Lin, M.C. (November, January 29). Fast penetration depth estimation for elastic bodies using deformed distance fields. Proceedings of the Intelligent Robots and Systems, Maui, HI, USA."},{"key":"ref_5","unstructured":"Weisstein, E.W. (2018, July 10). Point-Line Distance\u20133-Dimensional. MathWorld\u2013A Wolfram Web Resource. Available online: http:\/\/mathworld.wolfram.com\/Point-LineDistance3-Dimensional.html."},{"key":"ref_6","unstructured":"Gribanov, I. (2018, July 10). Distance Derivatives, GitHub Repository. Available online: https:\/\/github.com\/Spear520\/dist\/."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/7\/104\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:11:51Z","timestamp":1760195511000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/7\/104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,12]]},"references-count":6,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2018,7]]}},"alternative-id":["a11070104"],"URL":"https:\/\/doi.org\/10.3390\/a11070104","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2018,7,12]]}}}