A remark on computing distance functions (Q1587862): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078310966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing minimal surfaces via level set curvature flow / 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: Axisymmetric free boundary problems / 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: Motion of multiple junctions: A level set approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast level set method for propagating interfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast tree-based redistancing for level set computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree methods for moving interfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient, Interface-Preserving Level Set Redistancing Algorithm and Its Application to Interfacial Incompressible Fluid Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331794 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:46, 3 June 2024

scientific article
Language Label Description Also known as
English
A remark on computing distance functions
scientific article

    Statements

    A remark on computing distance functions (English)
    0 references
    0 references
    0 references
    26 June 2001
    0 references
    The paper deals with a new method for the reconstruction of the distance function. The interface is updated by solving a transport equation. The reinitialization of the interface is based on solving an initial value problem for the Hamilton-Jacobi equation. This problem is solved by a truly upwind method -- an modification of the algorithm introduced by \textit{M. Sussman, P. Smereka} and \textit{S. Osher} [J. Comput. Phys. 114, No. 1, 146-159 (1994; Zbl 0808.76077)]. A high-resolution version of the method is presented.
    0 references
    0 references
    0 references
    0 references
    0 references
    distance function
    0 references
    level set methods
    0 references
    upwind schemes
    0 references
    transport equation
    0 references
    Hamilton-Jacobi equation
    0 references
    0 references