O(\(N\)) implementation of the fast marching algorithm

DOI10.1016/J.JCP.2005.08.005zbMath1083.65083OpenAlexW2168463767MaRDI QIDQ2581675

Liron Yatziv, Guillermo Sapiro, Alberto Bartesaghi

Publication date: 10 January 2006

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: http://purl.umn.edu/4100

zbMATH Keywords

numerical exampleserror boundeikonal equationsstatic Hamilton-Jacobi equationfast marching algorithm

Mathematics Subject Classification ID

First-order nonlinear hyperbolic equations (35L60) Finite difference methods for initial value and initial-boundary value problems involving PDEs (65M06) Error bounds for initial value and initial-boundary value problems involving PDEs (65M15)

Related Items (20)

Automatic optimal feeder design in steel casting process ⋮ A geodesic approach to calculating the information sets in dynamic search problems ⋮ A Continuous Finite Element Method with Homotopy Vanishing Viscosity for Solving the Static Eikonal Equation ⋮ Structure-sensitive superpixels via geodesic distance ⋮ Exploration of 2D and 3D environments using Voronoi transform and fast marching method ⋮ A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching ⋮ Viscosity solutions for geodesic active contour under geometrical conditions ⋮ Revisiting priority queues for image analysis ⋮ An adaptive domain-decomposition technique for parallelization of the fast marching method ⋮ Generalized fast marching method: applications to image segmentation ⋮ A second order discontinuous Galerkin fast sweeping method for eikonal equations ⋮ Segmentation of complex geophysical structures with well data ⋮ Interactively multiphase image segmentation based on variational formulation and graph cuts ⋮ A fast-marching like algorithm for geometrical shock dynamics ⋮ Fast and accurate surface normal integration on non-rectangular domains ⋮ Fast asymmetric fronts propagation for image segmentation ⋮ Ordered line integral methods for solving the eikonal equation ⋮ An Easily Implemented, Block-Based Fast Marching Method with Superior Sequential and Parallel Performance ⋮ An immersed boundary method for geometrical shock dynamics ⋮ Scale Invariant Metrics of Volumetric Datasets

Cites Work

• Unnamed Item
• Unnamed Item
• High order fast sweeping methods for static Hamilton-Jacobi equations
• Computing geodesic paths on manifolds
• Markov Chain Approximations for Deterministic Control Problems with Affine Dynamics and Quadratic Cost in the Control
• Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
• A fast sweeping method for Eikonal equations
• Efficient algorithms for globally optimal trajectories
• A fast marching level set method for monotonically advancing fronts.
• Optimal algorithm for shape from shading and path planning
• Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces

This page was built for publication: O(\(N\)) implementation of the fast marching algorithm