Level Set Method
Also known as: Level-set, LSM, signed distance method
The Level Set Method is an implicit interface tracking technique introduced by Osher and Sethian in 1988 for moving boundary problems and multiphase flows. Rather than explicitly tracking the interface, level sets represent it as the zero level set (contour) of a signed distance function φ. This approach elegantly handles topological changes, naturally computes interface curvature and normals, and integrates well with Eulerian solvers. Level sets have become essential for image processing, shape optimization, and interface-dominated fluid dynamics problems.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
When to use it
Level sets are preferred when sharp interface representation and accurate curvature computation are critical, such as in crystal growth, electrokinetic flows, and image-based simulations. Use level sets when interface dynamics (motion, stretching, curvature) drive the physics. Avoid level sets for highly non-conservative problems where mass loss from reinitialization is unacceptable, or for problems requiring strict volume conservation (use VOF instead). Level sets excel in image-based methods and topology optimization due to natural curvature and gradient computation.
Strengths & limitations
- Naturally computes interface curvature and normals through gradient operations on φ
- Handles topological changes (merging, breaking, splitting) implicitly and automatically
- Works naturally on both structured and unstructured grids
- Well-suited for shape optimization and inverse problems via sensitivity analysis
- Supports extension of physical quantities from interface to bulk via reinitialization
- Does not conserve mass strictly; phase volumes drift as φ is advected and reinitialized
- Requires periodic reinitialization to maintain |∇φ| = 1, which involves solving a PDE and causes diffusion
- Reinitialization smears interfaces; accuracy sensitive to reinit frequency and algorithm
- Handling of thin layers and triple-point contact lines is challenging
- Extrapolation of velocity and pressure across interfaces requires care to avoid errors
Frequently asked
What is reinitialization and why is it needed?
Advecting φ with velocity preserves the zero level set (interface), but the gradient |∇φ| drifts from 1. Over time, φ becomes steep or flat, causing numerical errors. Reinitialization solves a PDE (e.g., distance redistancing) to restore |∇φ| = 1 while preserving the zero level set. Without it, curvature calculations become inaccurate and interfaces thicken. Trade-off: reinitialization fixes distance but introduces diffusion and mass loss.
How is interface curvature computed in level set method?
Curvature is κ = ∇·(∇φ/|∇φ|), the divergence of the unit normal. Since n̂ = ∇φ/|∇φ|, you compute gradients of φ, normalize, then take divergence. Finite-difference approximations introduce noise, especially near the interface where |∇φ| ≈ 0. Smoothing φ locally before computing κ reduces oscillations. Accurate curvature is critical for surface tension forces.
How does level set handle mass conservation compared to VOF?
VOF is inherently conservative: volume fractions integrate to phase volume exactly. Level sets do not conserve mass; reinitialization dissipates interface region and causes volume loss (~1-2% per reinit in 2D, worse in 3D). Hybrid VOF-LS methods or mass-correction algorithms (recomputing velocity or pressure to conserve volume) address this. For engineering applications requiring strict conservation, VOF is preferred.
What are advantages of level sets over explicit interface tracking?
No explicit interface points means no merging/splitting logic needed. Complex topology changes happen naturally. Interface curvature and geometry are easily computed from φ gradients. No need for interface parameterization. Drawback: implicit representation is less intuitive, and level sets have weaker mass conservation.
How do I initialize a level set function accurately?
Use a Fast Marching Method (FMM) or Fast Sweeping Method (FSM) to compute the signed distance from the initial interface. For a simple interface (circle, ellipse), an analytical formula works. For complex initial geometries (e.g., from segmented images), FSM is efficient and accurate. Ensure |∇φ| = 1 at initialization to avoid numerical errors in early time steps.
Sources
- Osher, S., & Sethian, J. A. (1988). Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations. Journal of Computational Physics, 79(1), 12-49. DOI: 10.1016/0021-9991(88)90002-2 ↗
- Sethian, J. A. (1996). Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science. Cambridge University Press. ISBN: 978-0521645577
- Sussman, M., Smereka, P., & Osher, S. (1994). A level set approach for computing solutions to incompressible two-phase flow. Journal of Computational Physics, 114(1), 146-159. DOI: 10.1006/jcph.1994.1155 ↗
How to cite this page
ScholarGate. (2026, June 3). Level Set Method. ScholarGate. https://scholargate.app/en/fluid-dynamics/level-set-method
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Boundary Layer TheoryFluid Dynamics↔ compare
- Direct Numerical SimulationFluid Dynamics↔ compare
- Eulerian-Lagrangian ModelFluid Dynamics↔ compare
- Large Eddy SimulationFluid Dynamics↔ compare
- Volume of FluidFluid Dynamics↔ compare