The gradient and the Hessian of the distance between point and triangle in 3D

DOI10.3390/A11070104MaRDI QIDQ2287494zbMATH OpenOpenAlexWikidataFDO

Authors Igor Gribanov, Rocky Taylor, Robert Sarracino

Publication date 21 January 2020

Published in Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3390/a11070104

zbMATH Keywords

gradientHessianpoint-triangle distance

Mathematics Subject Classification ID

Continuity and differentiation questions (26B05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Review text

Summary: 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.

Recommendations

• scientific article; zbMATH DE number 1246408
• scientific article; zbMATH DE number 1440920
• An accurate distance-calculation algorithm for convex polyhedra
• Computation of the Hausdorff distance between two ellipses
• Fast and Accurate Circle-Circle and Circle-Line 3D Distance Computation

Cited in

(2)

• dist
• An efficient Cartesian mesh generation strategy for complex geometries

Describes a project that uses

Uses Software

• Mathematica

This page was built for publication: The gradient and the Hessian of the distance between point and triangle in 3D

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2287494)