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

DOI10.1016/J.JCP.2011.12.001MaRDI QIDQ419607zbMATH OpenOpenAlexFDO

Authors Emmanuel Brun, Arthur Guittet, 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

numerical examplesalgorithmsemidiscretizationHamilton-Jacobi equationGodunov schemeirregular domainslevel-setreinitializationhash tableslocal level-set

Mathematics Subject Classification ID

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

Recommendations

• A Local Level-Set Method under Involvement of Topological Aspects
• A memory and computation efficient sparse level-set method
• A PDE-based fast local level set method
• Local level set method in high dimension and codimension
• A non-local formulation for level-set modelling
• Efficient local level set method without reinitialization and its appliance to topology optimization
• A finite element method for level sets
• A level set method using the signed distance function

Cites work

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

Cited in

(13)

• A contact algorithm for voxel-based meshes using an implicit boundary representation
• A review of level-set methods and some recent applications
• A Deep Learning Approach for the Computation of Curvature in the Level-Set Method
• Adaptive gradient-augmented level set method with multiresolution error estimation
• A non-parametric gradient-based shape optimization approach for solving inverse problems in directed self-assembly of block copolymers
• The distortion of the level set gradient under advection
• Parallel level-set methods on adaptive tree-based grids
• A sharp computational method for the simulation of the solidification of binary alloys
• High resolution sharp computational methods for elliptic and parabolic problems in complex geometries
• A sharp numerical method for the simulation of Stefan problems with convective effects
• 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
• An efficient mass-preserving interface-correction level set/ghost fluid method for droplet suspensions under depletion forces

Describes a project that uses

Uses Software

• Gerris

This page was built for publication: A local level-set method using a hash table data structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q419607)