Conference paper Open Access

A Moving Mesh Adaptation Method by Optimal Transport

An, Dongsheng; Lei, Na; Zhao, Tong; Si, Hang; Gu, Xianfeng

Optimal transportation finds the most economical way to transport one probability measure to another, and it plays an important role in geometric modeling and processing. In this paper, we propose a moving mesh method to generate adaptive meshes by optimal transport. Given an initial mesh and a scalar density function defined on the mesh domain, our method will redistribute the mesh nodes such that they are adapted to the density function. Based on the Brenier theorem, solving an optimal transportation problem is reduced to solving a Monge-Ampère equation, which is difficult to compute due to the high non-linearity. On the other hand, the optimal transportation problem is equivalent to the Alexandrov problem, which can finally induce an effective variational algorithm. Experiments show that our proposed method finds the adaptive mesh quickly and efficiently.

Files (6.2 MB)
Name Size
10-An.pdf
md5:697fc17968f8f60397c2a0271287df8e
6.2 MB Download
53
22
views
downloads
All versions This version
Views 5353
Downloads 2222
Data volume 136.2 MB136.2 MB
Unique views 5050
Unique downloads 2121

Share

Cite as