arrow
Return

Variance-Minimizing Transport Plans for Inter-surface Mapping

delete2017-07-20
delete42
delete
OA
AI
M
Manish Mandad *
D
David Cohen‐Steiner
L
Leif Kobbelt
P
Pierre Alliez
M
Mathieu Desbrun
DOI:10.1145/3072959.3073671delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We introduce an efficient computational method for generating dense and low distortion maps between two arbitrary surfaces of same genus. Instead of relying on semantic correspondences or surface parameterization, we directly optimize a variance-minimizing transport plan between two input surfaces that defines an as-conformal-as-possible inter-surface map satisfying a user-prescribed bound on area distortion. The transport plan is computed via two alternating convex optimizations, and is shown to minimize a generalized Dirichlet energy of both the map and its inverse. Computational efficiency is achieved through a coarse-to-fine approach in diffusion geometry, with Sinkhorn iterations modified to enforce bounded area distortion. The resulting inter-surface mapping algorithm applies to arbitrary shapes robustly, with little to no user interaction.
Keywords:
Inter-surface mapping
optimal transport
Sinkhorn iterations
diffusion geometry
area distortion
conformality
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

ACM Transactions on Graphics cover
ACM Transactions on Graphics
IF:
9.5
Papers:
4.7K
Citations:
3.6W

Organization

R
RWTH Aachen University
Scholars:
3.5W
Papers: 2.6W
Citations: 3.6W
I
Inria
Scholars:
3.5K
Papers: 2.5K
Citations: 343