.png){kind=icon}
Return
A remark on computing distance functions
.png){kind=icon}
PRE
AI
DOI：10.1006/jcph.2000.6553.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
LEVEL SET METHOD
INTERFACES
FLOW
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.8
Papers:
1.6W
Citations:
7.4W
Organization
No organization information available
Cited Papers
ShareSaveShareSaveEffects of Dietary Nitrate, Caffeine, and Their Combination on 20-km Cycling Time Trial Performance
OAAI
OAAIShareSaveShareSaveChromatin state dynamics confers specific therapeutic strategies in enhancer subtypes of colorectal cancer.png)
Gut
OAAI
GutIF0
OAAIShareSave no more
no more