13 research outputs found

    3/4 discrete optimal transport

    No full text
    International audienceThis paper deals with the 3 4-discrete 2-Wasserstein optimal transport between two measures, where one is supported by a set of segment and the other one is supported by a set of Dirac masses. We select the most suitable optimization procedure that computes the optimal transport and provide numerical examples of approximation of cloud data by segments

    Differentiation and regularity of semi-discrete optimal transport with respect to the parameters of the discrete measure

    No full text
    International audienceThis paper aims at determining under which conditions the semi-discrete optimal transport is twice dierentiable with respect to the parameters of the discrete measure and exhibits numerical applications. The discussion focuses on minimal conditions on the background measure to ensure dierentiability. We provide numerical illustrations in stippling and blue noise problems

    Approximation of curves with piecewise constant or piecewise linear functions

    Get PDF
    In this paper we compute the Hausdorff distance between sets of continuous curves and sets of piecewise constant or linear discretizations. These sets are Sobolev balls given by the continuous or discrete L p-norm of the derivatives. We detail the suitable discretization or smoothing procedure which are preservative in the sense of these norms. Finally we exhibit the link between Eulerian numbers and the uniformly space knots B-spline used for smoothing

    Optimal Transport Approximation of 2-Dimensional Measures

    Get PDF
    International audienceWe propose a fast and scalable algorithm to project a given density on a set of structured measures defined over a compact 2D domain. The measures can be discrete or supported on curves for instance. The proposed principle and algorithm are a natural generalization of previous results revolving around the generation of blue-noise point distributions, such as Lloyd's algorithm or more advanced techniques based on power diagrams. We analyze the convergence properties and propose new approaches to accelerate the generation of point distributions. We also design new algorithms to project curves onto spaces of curves with bounded length and curvature or speed and acceleration. We illustrate the algorithm's interest through applications in advanced sampling theory, non-photorealistic rendering and path planning

    Approches variationnelles pour le stippling : distances L 2 ou transport optimal ?

    No full text
    International audienceLe stippling est un problème qui a beaucoup progressé dernièrement grâce à l'introduction de méthodes variationnelles. On s'intéresse ici à deux types de formulations. L'une repose sur une distance L 2 entre mesures et fait appel à des outils d'analyse harmonique appliquée. L'autre repose sur la distance de Wasserstein et fait appel à des outils de géométrie algorithmique. Différentes méthodes de résolution et de discrétisation sont comparées et nous présentons leurs atouts et leurs limitations. Abstract-Stippling is a problem that recently found elegant and efficient solutions thanks to the introduction of variational methods. The aim of this paper is to compare two state-of-the-art approaches: one is based on the minimization of an L 2 norm (which links to applied harmonic analysis), while the other is based on the Wasserstein distance (which links to computational geometry)

    3/4-Discrete Optimal Transport

    No full text
    corecore