Return
A PDE-based fast local level set method
DOI:10.1006/jcph.1999.6345.png)
Abstract
En 中文
We develop a fast method to localize the level set method of Osher and Sethian (1988, J. Comput. Phys. 79, 12) and address two important issues that are intrinsic to the level set method: (a) how to extend a quantity that is given only on the interface to a neighborhood of the interface; (b) how to reset the level set function to be a signed distance function to the interface efficiently without appreciably moving the interface. This fast local level set method reduces the computational effort by one order of magnitude, works in as much generality as the original one, and is conceptually simple and easy to implement. Our approach differs from previous related works in that we extract all the information needed from the level set function (or functions in multiphase flow) and do not need to find explicitly the location of the interface in the space domain. The complexity of our method to do tasks such as extension and distance reinitialization is O (N), where N is the number of points in space, not O(N log N) as in works by Sethian (1996, Proc. Not. Acad. Sci. 93, 1591) and Helmsen and co-workers (1996, SPIE Microlithography IX, p. 253). This complexity estimation is also valid for quite general geometrically based front motion for our localized method. (C) 1999 Academic Press.
Keywords:
HAMILTON-JACOBI EQUATIONS
MEAN-CURVATURE
MOTION
REGULARIZATION
FORMULATION
SCHEMES
FRONTS
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
A Detailed Analytical Model of a Salient-Pole Synchronous Generator Under Dynamic Eccentricity Fault

