An algorithm for optimal transport between a simplex soup and a point cloud

by   Quentin Mérigot, et al.

We propose a numerical method to find the optimal transport map between a measure supported on a lower-dimensional subset of R^d and a finitely supported measure. More precisely, the source measure is assumed to be supported on a simplex soup, i.e. on a union of simplices of arbitrary dimension between 2 and d. As in [Aurenhammer, Hoffman, Aronov, Algorithmica 20 (1), 1998, 61--76] we recast this optimal transport problem as the resolution of a non-linear system where one wants to prescribe the quantity of mass in each cell of the so-called Laguerre diagram. We prove the convergence with linear speed of a damped Newton's algorithm to solve this non-linear system. The convergence relies on two conditions: (i) a genericity condition on the point cloud with respect to the simplex soup and (ii) a (strong) connectedness condition on the support of the source measure defined on the simplex soup. Finally, we apply our algorithm in R^3 to compute optimal transport plans between a measure supported on a triangulation and a discrete measure. We also detail some applications such as optimal quantization of a probability density over a surface, remeshing or rigid point set registration on a mesh.


page 19

page 20


Two Stage Algorithm for Semi-Discrete Optimal Transport on Disconnected Domains

In this paper we present a two-stage algorithm to solve the semi-discret...

Constrained Mass Optimal Transport

Optimal mass transport, also known as the earth mover's problem, is an o...

Learning Probability Measures with respect to Optimal Transport Metrics

We study the problem of estimating, in the sense of optimal transport me...

Higher-dimensional power diagrams for semi-discrete optimal transport

Efficient algorithms for solving optimal transport problems are importan...

Non-asymptotic convergence bounds for Sinkhorn iterates and their gradients: a coupling approach

Computational optimal transport (OT) has recently emerged as a powerful ...

A Sinkhorn-Newton method for entropic optimal transport

We consider the entropic regularization of discretized optimal transport...

Computational Semi-Discrete Optimal Transport with General Storage Fees

We propose and analyze a modified damped Newton algorithm to solve the s...

Please sign up or login with your details

Forgot password? Click here to reset