Evaluating a distance function

11/04/2022
by   Rémi Abgrall, et al.
0

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.

READ FULL TEXT

page 7

page 10

page 11

research
07/03/2021

A fast algorithm for computing the Boys function

We present a new fast algorithm for computing the Boys function using no...
research
07/08/2019

A fast simple algorithm for computing the potential of charges on a line

We present a fast method for evaluating expressions of the form u_j = ∑...
research
10/03/2018

Approximating Approximate Pattern Matching

Given a text T of length n and a pattern P of length m, the approximate ...
research
10/27/2022

Faster Linear Algebra for Distance Matrices

The distance matrix of a dataset X of n points with respect to a distanc...
research
12/13/2011

A new variational principle for the Euclidean distance function: Linear approach to the non-linear eikonal problem

We present a fast convolution-based technique for computing an approxima...
research
04/29/2021

MongeNet: Efficient Sampler for Geometric Deep Learning

Recent advances in geometric deep-learning introduce complex computation...

Please sign up or login with your details

Forgot password? Click here to reset