.png){kind=icon}
返回
A remark on computing distance functions
.png){kind=icon}
PRE
AI
DOI：10.1006/jcph.2000.6553.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a new method for the reconstruction of the signed distance function in the context of level set methods. The new method is a modification of the algorithm which makes use of the PDE equation for the distance function introduced by M. Sussman, P. Smereka, and S. Osher (1994, J. Comput. Phys. 119, 146). It is based mainly on the use of a truly upwind discretization near the interface. Comparison with the previous algorithm shows a definite improvement. When used with a first-order upwind scheme, the method provides first-order accuracy for the signed distance function in the whole computational domain, and second-order accuracy in the location of the interface. A second-order version of the method is also presented. (C) 2000 Academic Press.
Keyword:
LEVEL SET METHOD
INTERFACES
FLOW
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
暂无机构信息
引用论文
分享收藏Effects of Dietary Nitrate, Caffeine, and Their Combination on 20-km Cycling Time Trial Performance饮食中硝酸盐，咖啡因及其组合对20公里自行车时间试验性能的影响
OAAI
OAAI分享收藏Chromatin state dynamics confers specific therapeutic strategies in enhancer subtypes of colorectal cancer.png)
Gut
OAAI
GutIF0
OAAI分享收藏 没有更多内容
没有更多内容