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.
翻译:将距离函数计算为某些表面或线条是一个经常发生的问题。 计算此函数的相关近似有几种方法, 例如使用来自汉密尔顿· 雅各比近似问题的技术, 或快速扫瞄方法。 我们在这里与一些椭圆问题挂钩, 并提出一个非常快速的近近似距离函数的方法 。