O(\(N\)) implementation of the fast marching algorithm (Q2581675): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Markov Chain Approximations for Deterministic Control Problems with Affine Dynamics and Quadratic Cost in the Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing geodesic paths on manifolds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithm for shape from shading and path planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast marching level set method for monotonically advancing fronts. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for globally optimal trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: High order fast sweeping methods for static Hamilton-Jacobi equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast sweeping method for Eikonal equations / rank
 
Normal rank

Latest revision as of 13:59, 11 June 2024

scientific article
Language Label Description Also known as
English
O(\(N\)) implementation of the fast marching algorithm
scientific article

    Statements

    Identifiers