Fast tree-based redistancing for level set computations (Q1302930): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:09, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast tree-based redistancing for level set computations |
scientific article |
Statements
Fast tree-based redistancing for level set computations (English)
0 references
8 February 2000
0 references
The author presents efficient algorithms for 94 in moving interface problem. The algorithms use quadtrees and triangulation to compute global approximate signed distance functions. A quadtree mesh is built to resolve the interface and the vertex distances are evaluated exactly with a robust search strategy to provide both continuous and discontinuous interpolants. Two-dimensional numerical results show they are highly efficient in practice.
0 references
moving interfaces
0 references
level set
0 references
distance function
0 references
algorithms
0 references
numerical results
0 references
