O(N) implementation of the fast marching algorithm

DOI10.1016/J.JCP.2005.08.005MaRDI QIDQ2581675zbMATH OpenOpenAlexFDO

Authors Liron Yatziv, Alberto Bartesaghi, Guillermo Sapiro

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

eikonal equationserror boundfast marching algorithmnumerical examplesstatic Hamilton-Jacobi equation

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)

Recommendations

• Remarks on the implementation of the fast marching method
• The eikonal equation: numerical efficiency vs. algorithmic complexity on quadrilateral grids
• Computational Study of Fast Methods for the Eikonal Equation
• A characteristics driven fast marching method for the eikonal equation
• Some improvements of the fast marching method

Cites work

• A fast marching level set method for monotonically advancing fronts.
• A fast sweeping method for Eikonal equations
• Computing geodesic paths on manifolds
• Efficient algorithms for globally optimal trajectories
• Fast computation of weighted distance functions and geodesics on implicit hyper-surfaces
• Fast Sweeping Algorithms for a Class of Hamilton--Jacobi Equations
• High order fast sweeping methods for static Hamilton-Jacobi equations
• scientific article; zbMATH DE number 976936 (Why is no real title available?)
• scientific article; zbMATH DE number 2063782 (Why is no real title available?)
• Markov Chain Approximations for Deterministic Control Problems with Affine Dynamics and Quadratic Cost in the Control
• Optimal algorithm for shape from shading and path planning

Cited in

(22)

• Fast asymmetric fronts propagation for image segmentation
• Revisiting priority queues for image analysis
• Fast and accurate surface normal integration on non-rectangular domains
• Ordered line integral methods for solving the eikonal equation
• Anisotropic fast-marching on Cartesian grids using lattice basis reduction
• Viscosity solutions for geodesic active contour under geometrical conditions
• Structure-sensitive superpixels via geodesic distance
• A Gromov-Hausdorff framework with diffusion geometry for topologically-robust non-rigid shape matching
• A continuous finite element method with homotopy vanishing viscosity for solving the static eikonal equation
• An easily implemented, block-based fast marching method with superior sequential and parallel performance
• Scale invariant metrics of volumetric datasets
• Remarks on the implementation of the fast marching method
• Exploration of 2D and 3D environments using Voronoi transform and fast marching method
• An adaptive domain-decomposition technique for parallelization of the fast marching method
• Segmentation of complex geophysical structures with well data
• A fast-marching like algorithm for geometrical shock dynamics
• An immersed boundary method for geometrical shock dynamics
• Automatic optimal feeder design in steel casting process
• A geodesic approach to calculating the information sets in dynamic search problems
• Generalized fast marching method: applications to image segmentation
• A second order discontinuous Galerkin fast sweeping method for eikonal equations
• Interactively multiphase image segmentation based on variational formulation and graph cuts

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581675)