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.
Revised:
Accepted:
Online First:
Published online:
Rémi Abgrall 1

@article{CRMECA_2023__351_S1_5_0, author = {R\'emi Abgrall}, title = {Evaluating a distance function}, journal = {Comptes Rendus. M\'ecanique}, pages = {5--15}, publisher = {Acad\'emie des sciences, Paris}, volume = {351}, number = {S1}, year = {2023}, doi = {10.5802/crmeca.155}, language = {en}, }
Rémi Abgrall. Evaluating a distance function. Comptes Rendus. Mécanique, The scientific legacy of Roland Glowinski, Volume 351 (2023) no. S1, pp. 5-15. doi : 10.5802/crmeca.155. https://comptes-rendus.academie-sciences.fr/mecanique/articles/10.5802/crmeca.155/
[1] High-order essentially nonoscillatory schemes for Hamilton-Jacobi equations, SIAM J. Numer. Anal., Volume 28 (1991) no. 4, pp. 907-922 | DOI | MR | Zbl
[2] Numerical discretization of the first-order Hamilton–Jacobi equation on triangular meshes, Commun. Pure Appl. Math., Volume 49 (1996) no. 12, pp. 1339-1373 | DOI | MR | Zbl
[3] Fast marching methods, SIAM Rev., Volume 41 (1999) no. 2, pp. 199-235 | DOI | MR | Zbl
[4] A hyperbolic Poisson solver for wall distance computation on irregular triangular grids, J. Comput. Phys., Volume 445 (2021), 110599 | DOI | MR | Zbl
[5] A minimization-based finite element formulation for interface-preserving level set reinitialization, Computing, Volume 95 (2013) no. S1, pp. 13-25 | DOI | MR
[6] A high-order elliptic PDE based level set reinitialisation method using a discontinuous Galerkin discretisation, J. Comput. Phys., Volume 379 (2019), pp. 373-391 | DOI | MR | Zbl
[7] Solutions de viscosité des équations de Hamilton–Jacobi, Mathématiques & Applications (Berlin), 17, Springer, 1994 | MR | Zbl
[8] Construction of simple, stable, and convergent high order schemes for steady first order Hamilton–Jacobi equations, SIAM J. Sci. Comput., Volume 31 (2009) no. 4, pp. 2419-2446 | DOI | MR | Zbl
[9] PaStiX: A High-Performance Parallel Direct Solver for Sparse Symmetric Definite Systems, Parallel Comput., Volume 28 (2002) no. 2, pp. 301-321 | DOI | MR | Zbl
[10] Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities, Int. J. Numer. Methods Eng., Volume 79 (2009) no. 11, pp. 1309-1331 | DOI | MR | Zbl
[11] A finite element/operator-splitting method for the numerical solution of the three dimensional Monge–Ampère equation, J. Sci. Comput., Volume 81 (2019) no. 3, pp. 2271-2302 | DOI | Zbl
[12] A finite element/operator-splitting method for the numerical solution of the two dimensional elliptic Monge–Ampère equation, J. Sci. Comput., Volume 79 (2019) no. 1, pp. 1-47 | DOI | Zbl
[13] A least-squares/relaxation method for the numerical solution of the three-dimensional elliptic Monge–Ampère equation, J. Sci. Comput., Volume 77 (2018) no. 1, pp. 53-78 | DOI | Zbl
Cited by Sources:
Comments - Policy