Search arXiv⌕ Search

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

Sobriety of Scott topologies under countability conditions

In this paper, we focus on the sobriety of the Scott topology in countable case. Specifically, we show that: (1) every meet-continuous core-compact countable dcpo is sober with respect to the Scott topology; (2)every countable locally compact dcpo is sober endowed with the Scott topology; (3) the lattice of all open sets for the rational numbers space Q equipped with the Scott topology is not sober.

math.GN↗

Scott--Isbell Coincidence for Continuous Dcpos beyond Bicompleteness

Lawson and Mislove posed the following problem in 1990 as Problem~535 in \emph{Open Problems in Topology}: for a core-compact space \(X\) and a dcpo \(P\) equipped with its Scott topology, under what conditions on \(P\) do the Isbell and Scott topologies on \(C(X,P)\) agree?It was proved that, for a nonempty bicomplete continuous dcpo \(P\), the Isbell and Scott topologies on \(C(X,P)\) coincide for every core-compact space \(X\) if and only if \(P\) is bounded complete; for every compact core-compact space \(X\) if and only if \(P\) is conditionally bounded complete; and for every RW-space \(X\) if and only if \(P\) is a pointed continuous \(L\)-domain.We remove the bicompleteness assumption from all three classifications by combining the forbidden-retract theorem of Jia, Jung and Li with a separation theorem for powers of downward well-ordered chains and suitable Alexandrov test spaces.

math.GN↗

Primeless proofs of the Menger and Rothberger games

We continue the study of the Menger and Rothberger games on lattices initiated in arXiv:2102.12901. This time, we extend the earlier results by dropping some hypotheses that turned out to be unnecessary, and use Stone duality to recover known game characterizations for dense open families. We also give a formulation of Ufin for partially ordered sets and prove its game characterization without any lattice assumption. Finally, almost disjoint families give complete distributive lattices on which the selection principles and the corresponding games differ. We obtain lower bounds $\operatorname{cov}(\mathcal M)$ and $\mathfrak d$ for the least sizes of such counterexamples.

math.GN↗