Simplex free adaptive tree fast sweeping and evolution methods for solving level set equations in arbitrary dimension

DOI10.1016/J.JCP.2005.08.020MaRDI QIDQ2489696zbMATH OpenOpenAlexFDO

Authors Thomas C. Cecil, Stanley Osher, Jianliang Qian

Publication date 28 April 2006

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

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

zbMATH Keywords

Binary treesconvergenceFast sweepingHamilton-Jacobi equationsLevel setsnumerical examplessimplex free adaptive tree numerical methods

Mathematics Subject Classification ID

First-order nonlinear hyperbolic equations (35L60) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs (65M12)

Recommendations

• Tree methods for moving interfaces
• A review of level-set methods and some recent applications
• The flexible, extensible and efficient toolbox of level set methods
• Local level set method in high dimension and codimension
• A PDE-based fast local level set method

Cites work

• A fast level set method for propagating interfaces
• A fast sweeping method for Eikonal equations
• A level set formulation for Willmore flow
• A level set method for the computation of multivalued solutions to quasi-linear hyperbolic PDEs and Hamilton-Jacobi equations
• A level set-based Eulerian approach for anisotropic wave propagation
• A PDE-based fast local level set method
• A STOCHASTIC REPRESENTATION FOR THE LEVEL SET EQUATIONS
• An adaptive level set approach for incompressible two-phase flows
• An adaptive level set method for medical image segmentation
• Computational high-frequency wave propagation using the level set method with applications to the semi-classical limit of Schrödinger equations
• Efficient algorithms for globally optimal trajectories
• Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
• Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
• Geometric optics in a phase-space-based level set and Eulerian framework
• Gerris: A tree-based adaptive solver for the incompressible Euler equations in complex geometries.
• High-Order Essentially Nonoscillatory Schemes for Hamilton–Jacobi Equations
• scientific article; zbMATH DE number 1349965 (Why is no real title available?)
• scientific article; zbMATH DE number 1419194 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Implicit and Nonparametric Shape Reconstruction from Unorganized Data Using a Variational Level Set Method
• Lax-Friedrichs sweeping scheme for static Hamilton-Jacobi equations
• Level set methods and dynamic implicit surfaces
• Local level set method in high dimension and codimension
• Motion of curves constrained on surfaces using a level-set approach
• Motion of curves in three spatial dimensions using a level set approach
• On the solution of nonlinear hyperbolic differential equations by finite differences
• Simple and Efficient Traversal Methods for Quadtrees and Octrees
• Superreplication Under Gamma Constraints
• The Nonconvex Multidimensional Riemann Problem for Hamilton–Jacobi Equations
• Tree methods for moving interfaces

Cited in

(11)

• Fast sweeping methods for factored anisotropic eikonal equations: multiplicative and additive factors
• Adaptive level set method applied to drag minimization problems constrained by Stokes equations
• An ordered upwind method with precomputed stencil and monotone node acceptance for solving static convex Hamilton-Jacobi equations
• Legendre-transform-based fast sweeping methods for static Hamilton-Jacobi equations on triangulated meshes
• An improved fast local level set method for three-dimensional inverse gravimetry
• A fast sweeping method for static convex Hamilton-Jacobi equations
• An adaptive level set method based on two-level uniform meshes and its application to dislocation dynamics
• Optimality criteria coupled adaptive mesh method for optimal shape design of Stokes flow
• A GPU-accelerated adaptive discontinuous Galerkin method for level set equation
• Essentially non-oscillatory adaptive tree methods
• Adaptive level set evolution starting with a constant function

Describes a project that uses

Uses Software

• Gerris

This page was built for publication: Simplex free adaptive tree fast sweeping and evolution methods for solving level set equations in arbitrary dimension

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