Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-09T06:26:14.689Z Has data issue: false hasContentIssue false

Theory, algorithms, and applications of level set methods for propagating interfaces

Published online by Cambridge University Press:  07 November 2008

James A. Sethian
Affiliation:
Department of MathematicsUniversity of CaliforniaBerkeley, CA 94720, USAE-mail:sethian@math.berkeley.edu

Abstract

We review recent work on level set methods for following the evolution of complex interfaces. These techniques are based on solving initial value partial differential equations for level set functions, using techniques borrowed from hyperbolic conservation laws. Topological changes, corner and cusp development, and accurate determination of geometric properties such as curvature and normal direction are naturally obtained in this setting. The methodology results in robust, accurate, and efficient numerical algorithms for propagating interfaces in highly complex settings. We review the basic theory and approximations, describe a hierarchy of fast methods, including an extremely fast marching level set scheme for monotonically advancing fronts, based on a stationary formulation of the problem, and discuss extensions to multiple interfaces and triple points. Finally, we demonstrate the technique applied to a series of examples from geometry, material science and computer vision, including mean curvature flow, minimal surfaces, grid generation, fluid mechanics, combustion, image processing, computer vision, and etching, deposition and lithography in the microfabrication of electronic components.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable