Fast tree-based redistancing for level set computations
From MaRDI portal
Publication:1302930
DOI10.1006/jcph.1999.6259zbMath0944.65020OpenAlexW1976102928MaRDI QIDQ1302930
Publication date: 8 February 2000
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/5df1b6d4a3ded9f389e4ca7623fd61a4b080ceea
Numerical optimization and variational techniques (65K10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items
A direct reinitialization approach of level-set/splitting finite element method for simulating incompressible two-phase flows ⋮ Local level set method in high dimension and codimension ⋮ Numerical modeling and experimental validation of free surface flow problems ⋮ A multigrid method on non-graded adaptive octree and quadtree Cartesian grids ⋮ A localized re-initialization equation for the conservative level set method ⋮ Locally corrected semi-Lagrangian methods for Stokes flow with moving elastic interfaces ⋮ High resolution sharp computational methods for elliptic and parabolic problems in complex geometries ⋮ A review of level-set methods and some recent applications ⋮ Sharp interface simulations with local mesh refinement for multi-material dynamics in strongly shocked flows ⋮ Adaptively refined, parallelised sharp interface Cartesian grid method for three-dimensional moving boundary problems ⋮ A mixed interface-capturing/interface-tracking formulation for thermal multi-phase flows with emphasis on metal additive manufacturing processes ⋮ A Simple Implementation of the Semi-Lagrangian Level-Set Method ⋮ A simple embedding method for solving partial differential equations on surfaces ⋮ An anti-diffusive numerical scheme for the simulation of interfaces between compressible fluids by means of a five-equation model ⋮ Computation of the signed distance function to a discrete contour on adapted triangulation ⋮ A numerical method for computing minimal surfaces in arbitrary dimension ⋮ A fast semi-Lagrangian contouring method for moving interfaces ⋮ A topology-preserving level set method for shape optimization ⋮ Computing multivalued physical observables for the semiclassical limit of the Schrödinger equation ⋮ A level set based finite element algorithm for the simulation of dendritic growth ⋮ The extended/generalized finite element method: An overview of the method and its applications ⋮ Simulation of high density ratio interfacial flows on cell vertex/edge-based staggered octree grids with second-order discretization at irregular nodes ⋮ Spatially adaptive techniques for level set methods and incompressible flow ⋮ A fast modular semi-Lagrangian method for moving interfaces ⋮ Sharp interface Cartesian grid method. I: An easily implemented technique for 3D moving boundary computations ⋮ A fixed grid method for capturing the motion of self-intersecting wavefronts and related PDEs ⋮ A remark on computing distance functions ⋮ Semi-Lagrangian methods for level set equations ⋮ Tree methods for moving interfaces ⋮ Rapid and accurate computation of the distance function using grids
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations
- Crystal growth and dendritic solidification
- The fast construction of extension velocities in level set methods
- Tree methods for moving interfaces
- A level set approach for computing solutions to incompressible two-phase flow
- A simple level set method for solving Stefan problems
- A compact piecewise-linear Voronoi diagram for convex sites in the plane
- Computation of three dimensional dendrites with finite elements
- Optimal Point Location in a Monotone Subdivision
- Lawson’s Triangulation is Nearly Optimal for Controlling Error Bounds
