Skip to content

Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations

Why this mattered

Osher and Sethian’s 1988 paper mattered because it turned moving-interface problems into a robust Eulerian computation. Instead of explicitly tracking a front as a parameterized curve or surface, the method represents it as the zero level set of a higher-dimensional function and evolves that function with a Hamilton-Jacobi equation. This reframing made it practical to compute fronts that merge, split, sharpen, form corners, or undergo topological change without special-case bookkeeping. For curvature-dependent motion, where geometry directly affects speed, that was a decisive shift: the interface could be treated as part of a stable PDE problem rather than as a fragile moving mesh.

The paper helped establish the level set method as a general computational language for evolving shapes. After it, problems in fluid interfaces, combustion, crystal growth, image segmentation, computer vision, materials science, and computational geometry could be attacked with a common numerical framework. Its influence also came from combining geometric insight with high-resolution numerical methods from conservation laws and Hamilton-Jacobi theory, making the approach both conceptually clean and computationally usable.

Subsequent breakthroughs built directly on this paradigm. Sethian’s fast marching methods, Osher-Fedkiw style numerical treatments of multiphase flow, geometric active contours in image analysis, and many later shape-optimization and free-boundary algorithms all relied on the idea that interfaces can be evolved implicitly through PDEs. The paper did not merely improve an existing front-tracking technique; it changed what counted as a tractable moving-boundary problem.

Abstract

(no abstract available)

Sources