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

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcph.1999.6259 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Wang Cheng-Shu / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Wang Cheng-Shu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Triangle / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976102928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fast construction of extension velocities in level set methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple level set method for solving Stefan problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Point Location in a Monotone Subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compact piecewise-linear Voronoi diagram for convex sites in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fronts propagating with curvature-dependent speed: Algorithms based on Hamilton-Jacobi formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of three dimensional dendrites with finite elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crystal growth and dendritic solidification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5607484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree methods for moving interfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A level set approach for computing solutions to incompressible two-phase flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lawson’s Triangulation is Nearly Optimal for Controlling Error Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments / 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