Results 11 to 20 of about 75,945 (317)

Comparison Principle for a Generalized Fast Marching Method [PDF]

open access: greenSIAM Journal on Numerical Analysis, 2009
International audienceIn \cite{CFFM06}, the authors have proposed a generalization of the classical Fast Marching Method of Sethian for the eikonal equation in the case where the normal velocity depends on space and time and can change sign.
Nicolas Forcadel
core   +9 more sources

A Comparison of Fast Marching, Fast Sweeping and Fast Iterative Methods for the Solution of the Eikonal Equation [PDF]

open access: diamondTelfor Journal, 2014
We compare the computational performance of the Fast Marching Method, the Fast Sweeping Method and the Fast Iterative Method to determine a numerical solution to the eikonal equation.
A. Capozzoli   +3 more
doaj   +7 more sources

Application of Fibonacci heap to fast marching method

open access: yesOpen Physics, 2021
The fast marching method (FMM) is an efficient, stable and adaptable travel time calculation method. In the realization of this method, it is necessary to select the minimum travel time node from the narrow band many times.
Meng Fanchang   +5 more
doaj   +3 more sources

On correctness of first and second order fast marching method [PDF]

open access: goldOpen Computer Science, 2011
AbstractIn this article we will discuss the Fast Marching Method which was introduced by James A. Sethian to solve some types of nonlinear partial differential equations efficiently. We will show that this method yields the unique solution to an upwind discretization.
Lass Christoph
doaj   +4 more sources

A Generalized Fast Marching Method for dislocation dynamics [PDF]

open access: yesSIAM Journal on Numerical Analysis, 2011
International audienceIn this paper, we consider a Generalized Fast Marching Method (GFMM) as a numerical method to compute dislocation dynamics. The dynamics of a dislocation hyper-surface in $\mathbb R^N$ (with $N=2$ for physical applications) is given
Carlini, Elisabetta   +2 more
core   +8 more sources

Convergence of a Generalized Fast Marching Method for a non-convex eikonal equation [PDF]

open access: green, 2008
International audienceWe present a new Fast Marching algorithm for a non-convex eikonal equation modeling front evolutions in the normal direction. The algorithm is an extension of the Fast Marching Method since the new scheme can deal with a \emph{time ...
Elisabetta Carlini   +3 more
openalex   +4 more sources

General Path Planning Methodology for Leader-Follower Robot Formations [PDF]

open access: yesInternational Journal of Advanced Robotic Systems, 2013
This paper describes a robust algorithm for mobile robot formations based on the Voronoi Fast Marching path planning method. This is based on the propagation of a wave throughout the model of the environment, the wave expanding faster as the wave's ...
Santiago Garrido   +3 more
doaj   +5 more sources

Redundancy in All Pairs Fast Marching Method [PDF]

open access: green2006 International Conference on Image Processing, 2006
In this paper, we analyze the redundancy in calculating all pairs of geodesic distances on a rectangular grid. Fast marching method is an efficient way to estimate the geodesic distances from a point. But when calculated for all the points on the grid, this introduces certain redundancy.
Luca Bertelli   +2 more
openalex   +3 more sources

Fully Isotropic Fast Marching Methods on Cartesian Grids [PDF]

open access: bronze, 2010
The existing Fast Marching methods which are used to solve the Eikonal equation use a locally continuous model to estimate the accumulated cost, but a discontinuous (discretized) model for the traveling cost around each grid point. Because the accumulated cost and the traveling (local) cost are treated differently, the estimate of the accumulated cost ...
Vikram Appia, Anthony Yezzi
  +8 more sources

Fast marching methods for the continuous traveling salesman problem [PDF]

open access: greenProceedings of the National Academy of Sciences, 2007
We consider a problem in which we are given a domain, a cost function which depends on position at each point in the domain, and a subset of points (“cities”) in the domain. The goal is to determine the cheapest closed path that visits each city in the domain once.
June Andrews, James A. Sethian
openalex   +5 more sources

Home - About - Disclaimer - Privacy