A remark on computing distance functions

被引：307

作者：

Russo, G ^{[1
]}

Smereka, P

机构：

[1] Univ Aquila, Dept Math, I-67100 Laquila, Italy

[2] Univ Michigan, Dept Math, Ann Arbor, MI 48109 USA

来源：

JOURNAL OF COMPUTATIONAL PHYSICS | 2000年 / 163卷 / 01期

基金：

美国国家科学基金会;

关键词：

D O I：

10.1006/jcph.2000.6553

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：51 / 67

页数：17