Evaluating a distance function

2022/11/04 by Abgrall, Rémi
#FOS: Mathematics #Numerical Analysis (math.NA)

paper · doi:10.48550/arxiv.2211.02319

Abstract

Computing the distance function to some surface or line is a problem that occurs very frequently. There are several ways of computing a relevant approximation of this function, using for example technique originating from the approximation of Hamilton Jacobi problems, or the fast sweeping method. Here we make a link with some elliptic problem and propose a very fast way to approximate the distance function.

Related

• A new variational principle for the Euclidean distance function: Linear approach to the non-linear eikonal problem
• Geodesic distance approximation using a surface finite element method for the p-Laplacian
• Construction of signed distance functions through an elliptic equation
• The Quick Dog Jumps the Log
• Comparing Distributions and Shapes using the Kernel Distance