Optimal mass transport for geometric modeling based on variational principles in convex geometry |
| |
Authors: | Zhengyu Su Jian Sun Xianfeng Gu Feng Luo Shing-Tung Yau |
| |
Affiliation: | 1. Computer Science Department, Stony Brook University, Stony Brook, USA 2. Mathematics Science Center, Tsinghua University, Beijing, China 3. Mathematics Department, Harvard University, Harvard, USA
|
| |
Abstract: | In geometric modeling, surface parameterization plays an important role for converting triangle meshes to spline surfaces. Parameterization will introduce distortions. Conventional parameterization methods emphasize on angle-preservation, which may induce huge area distortions and cause large spline fitting errors and trigger numerical instabilities.To overcome this difficulty, this work proposes a novel area-preserving parameterization method, which is based on an optimal mass transport theory and convex geometry. Optimal mass transport mapping is measure-preserving and minimizes the transportation cost. According to Brenier’s theorem, for quadratic distance transportation costs, the optimal mass transport map is the gradient of a convex function. The graph of the convex function is a convex polyhedron with prescribed normal and areas. The existence and the uniqueness of such a polyhedron have been proved by the Minkowski-Alexandrov theorem in convex geometry. This work gives an explicit method to construct such a polyhedron based on the variational principle, and formulates the solution to the optimal transport map as the unique optimum of a convex energy. In practice, the energy optimization can be carried out using Newton’s method, and each iteration constructs a power Voronoi diagram dynamically. We tested the proposal algorithms on 3D surfaces scanned from real life. Experimental results demonstrate the efficiency and efficacy of the proposed variational approach for the optimal transport map. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|