2000 character limit reached
Two Stage Algorithm for Semi-Discrete Optimal Transport on Disconnected Domains
Published 23 Oct 2019 in math.NA, cs.NA, and math.AP | (1910.10617v1)
Abstract: In this paper we present a two-stage algorithm to solve the semi-discrete Optimal Transport Problem in the case where the support of the source measure is disconnected. We establish global linear convergence and local superlinear convergence. We also find convergence of the associated Laguerre cells in the vein of \cite{BansilKitagawa19b}.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.