SearcharxivSearch

arXiv · 2507.01456

QC-OT: Optimal Transport with Quasiconformal Mapping

Abstract

The optimal transport (OT) map offers the most economical way to transfer one probability measure distribution to another. Classical OT theory does not involve a discussion of preserving topological connections and orientations in transmission results and processes. Existing numerical and geometric methods for computing OT seldom pays specific attention on this aspect. Especially, when dealing with the triangular mesh data, the known semi-discrete geometric OT (sd-OT) method employs critical operation of Delaunay triangulation (DT) to adapt topology to ensure the convexity of the energy function and the existence of the solution. This change in topology hampers the applicability of OT in modeling non-flip physical deformations in real-world tasks such as shape registration and editing problems in computer vision and medical imaging fields. This work introduces the topology structure-preserving optimal transport (QC-OT) map for the triangular mesh input. The computational strategy focuses on the two components: relaxing DT and convexity check in sd-OT and integrating quasiconformal (QC) correction. Here, quasiconformal mapping is employed to correct the regions unexpected distortions, and guarantee the topological preserving property of the transport. Furthermore, the spatial-temporal topology-preserving OT map is presented based t-OT to study the dynamics of the transportation. Multiple experiments have validated the efficiency and effectiveness of the proposed method and demonstrated its potential in the applications of mesh parameterization and image editing.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuping Lv, Qi Zhao, Xuebin Chang, Wei Zeng. 2025-07-02. QC-OT: Optimal Transport with Quasiconformal Mapping. https://arxiv.org/abs/2507.01456

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Maximal Center of Distances of Finite Ultrametric Spaces and Perfect Binary Trees

We investigate the finite ultrametric spaces $(X,d)$ that have a given cardinality of the center of distances and a minimal cardinality of the set $X$. It is shown that such spaces are isometric if and only if their centers of distances are the same. The representing trees of these spaces are characterized up to isomorphism.

math.GN

A continuous $3$-distributive frame that is not $\omega$-distributive

We give a negative answer to the question, posed by Ern\'e, whether every $3$-distributive lattice is $\omega$-distributive. More precisely, we exhibit a continuous frame that is $\kappa$-distributive for every integer $\kappa\geq 2$, but is not a wide coframe. The frame is the open-set lattice of a compact, locally compact, countably based $T_0$ topological meet-semilattice, obtained from Lawson's construction in the logarithmic form described by Goubault-Larrecq. The failure of $\omega$-distributivity is witnessed by an explicit matrix with countably many nonempty finite rows: all row joins are the same nonzero element, whereas every choice of one entry from each row has meet zero. The same space answers negatively Ern\'e's accompanying question whether every $4$-web space is a wide web space. All properties of the construction needed for these conclusions are proved directly.

math.GN

An overlooked weakening of perfect normality: Perfect regularity in spaces and locales

We introduce the notion of perfect regularity as an appropriate weakening of perfect normality, both for spaces and locales. Various characterizations are given, using Dedekind-MacNeille completions, injective hulls, and sublocales. We place the new class of perfectly regular frames among various well-studied classes of frames. We also introduce the construction of perfect regularization of a completely regular frame, compare it to Isbell's well-known booleanization construction, and argue that it is at least as important as the latter.

math.GN