A local level-set method using a hash table data structure

DOI10.1016/j.jcp.2011.12.001zbMath1242.65156OpenAlexW2026512586MaRDI QIDQ419607

Arthur Guittet, Emmanuel Brun, Frédéric Gibou

Publication date: 18 May 2012

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2011.12.001

zbMATH Keywords

algorithmHamilton-Jacobi equationnumerical examplessemidiscretizationGodunov schemeirregular domainshash tableslevel-setreinitializationlocal level-set

Mathematics Subject Classification ID

Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06) Method of lines for initial value and initial-boundary value problems involving PDEs (65M20) Hamilton-Jacobi equations (35F21)

Related Items

Adaptive gradient-augmented level set method with multiresolution error estimation, A volume-preserving reference map method for the level set representation, A hybrid inference system for improved curvature estimation in the level-set method using machine learning, The distortion of the level set gradient under advection, High resolution sharp computational methods for elliptic and parabolic problems in complex geometries, A review of level-set methods and some recent applications, An efficient mass-preserving interface-correction level set/ghost fluid method for droplet suspensions under depletion forces, A contact algorithm for voxel-based meshes using an implicit boundary representation, Parallel level-set methods on adaptive tree-based grids, A Deep Learning Approach for the Computation of Curvature in the Level-Set Method, A sharp numerical method for the simulation of Stefan problems with convective effects, A sharp computational method for the simulation of the solidification of binary alloys

Uses Software

• Gerris

Cites Work

• Unnamed Item
• Unnamed Item
• A second order accurate level set method on non-graded adaptive Cartesian grids
• Efficient implementation of essentially nonoscillatory shock-capturing schemes
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Tree methods for moving interfaces
• Gerris: A tree-based adaptive solver for the incompressible Euler equations in complex geometries.
• A remark on computing distance functions
• A second-order projection method for the incompressible Navier-Stokes equations
• A fast level set method for propagating interfaces
• An improved level set method for incompressible two-phase flows
• Geometric integration over irregular domains with application to level-set methods
• Dynamic tubular grid: an efficient data structure and algorithms for high resolution level sets
• A conservative level set method for two phase flow
• Efficient algorithms for globally optimal trajectories
• A fast marching level set method for monotonically advancing fronts.
• A semi-Lagrangian high-order method for Navier-Stokes equations