《Level Set Methods_ An Overview and Some Recent Results》.pdf

Journal of Computational Physics 169, 463–502 (2001) doi:10.1006/jcph.2000.6636, available online at on Level Set Methods: An Overview and Some Recent Results1 Stanley Osher and Ronald P. Fedkiw Department of Mathematics, University of California, Los Angeles, Los Angeles, California 90095; and Computer Science Department, Stanford University, Stanford, California 94305 Received March 1, 2000; revised September 11, 2000 The level set method was devised by S. Osher and J. A. Sethian (1988, J. Comput. Phys . 79, 12–49) as a simple and versatile method for computing and analyzing the motion of an interface in two or three dimensions. bounds a (possibly multiply connected) region . The goal is to compute and analyze the subsequent motion of under a velocity field v. This velocity can depend on position, time, the geometry of the interface, and the external physics. The interface is captured for later time as the zero level set of a smooth (at least Lipschitz continuous) function x t; i.e., t x x t 0. is positive inside , negative outside , and is zero on t. Topological merging and breaking are well defined and easily performed. In this review article we discuss recent variants and extensions, including the motion of curves in three dimensions, the dynamic surface extension method, fast methods for steady state problems, diffusion generated motion, and the variational level set approach. We also give a user’s guide to the level set dictionary and technology and couple the method to a wide variety of problems involving external physics, such as compressible and incompressible (possibly reacting) flow, Stefan problems, kinetic crystal growth, epitaxial growth of thin