Fast tree-based redistancing for level set computations (Q1302930): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
Property / DOI
 
Property / DOI: 10.1006/jcph.1999.6259 / rank
Normal rank
 
Property / DOI
 
Property / DOI: 10.1006/JCPH.1999.6259 / rank
 
Normal rank

Latest revision as of 17:46, 10 December 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
    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

    Identifiers