Computation of the signed distance function to a discrete contour on adapted triangulation
DOI10.1007/s10092-011-0051-zzbMath1258.65087OpenAlexW2147332805MaRDI QIDQ695622
Charles Dapogny, Pascal J. Frey
Publication date: 21 December 2012
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10092-011-0051-z
algorithmnumerical exampleslevel set methodeikonal equationanisotropic mesh adaptationsigned distance function\(\mathbb P^{1}\)-finite elements interpolation
Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Hamilton-Jacobi equations (35F21)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On optimal triangular meshes for minimizing the gradient error
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Directional adaptive surface triangulation
- Fast tree-based redistancing for level set computations
- A level set approach for computing solutions to incompressible two-phase flow
- Metric tensors for anisotropic mesh generation
- Level set methods and dynamic implicit surfaces
- Hamilton-Jacobi equations and distance functions on Riemannian manifolds
- An improved level set method for incompressible two-phase flows
- Computing minimal surfaces via level set curvature flow
- Redistancing by flow of time dependent eikonal equation
- Geometric approximationcontrol of interfaces using an anisotropic metric
- Anisotropic mesh adaptation for CFD computations
- A quadrature-free discontinuous Galerkin method for the level set equation
- A coupling strategy based on anisotropic mesh adaptation for solving two-fluid flows
- New Mass-Conserving Algorithm for Level Set Redistancing on Unstructured Meshes
- Mesh Generation
- Implicit Curves and Surfaces: Mathematics, Data Structures and Algorithms
- Computing geodesic paths on manifolds
- User’s guide to viscosity solutions of second order partial differential equations
- An Efficient, Interface-Preserving Level Set Redistancing Algorithm and Its Application to Interfacial Incompressible Fluid Flow
- Fast Marching Methods
- A fast sweeping method for Eikonal equations
- Normal Vector Voting: Crease Detection and Curvature Estimation on Large, Noisy Meshes
- A fast marching level set method for monotonically advancing fronts.
- Level set driven smooth curve approximation from unorganized or noisy point set
- Fast Sweeping Methods for Eikonal Equations on Triangular Meshes
- Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces