Add to ORKGInternational 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-dependent} velocity without \emph{any restriction on its sign}. We analyze the properties of the algorithm and we prove its convergence in the class of discontinuous viscosity solutions. Finally, we present some numerical simulations of fronts propagating in $\R^2$
The governing equation of the first arrival time of a monotonically propagating front (wavefront or ...
Abstract. A new algorithm is proposed to describe the propagation of fronts advected in the normal d...
In [4], the authors have proposed a generalization of the classical Fast Marching Method of Sethian ...
International audienceWe present a new Fast Marching algorithm for a non-convex eikonal equation mod...
We present a new fast-marching algorithm for an eikonal equation with a velocity changing sign. This...
In these notes, we present an introduction to the classical Fast Marching Method (FMM). The FMM has ...
International audienceIn \cite{CFFM06}, the authors have proposed a generalization of the classical ...
In this paper we introduce an extension of the Fast Marching Method introduced by Sethian [6] for th...
International audienceThe fast marching method is computationally efficient in approximating the vis...
We introduce and analyze a fast version of the semi-Lagrangian algorithm for front propagation origi...
The focus of this thesis is on the design of an algorithm that captures the non-monotone propagation...
International audienceIn this paper, we consider a Generalized Fast Marching Method (GFMM) as a nume...
Abstract. A computational study of the fast marching and the fast sweeping methods for the eikonal e...
AbstractA new front marching algorithm for solving the eikonal equation is presented. An important p...
Abstract. The non-monotonic propagation of fronts is considered. When the speed function F: Rn × [0,...
The governing equation of the first arrival time of a monotonically propagating front (wavefront or ...
Abstract. A new algorithm is proposed to describe the propagation of fronts advected in the normal d...
In [4], the authors have proposed a generalization of the classical Fast Marching Method of Sethian ...
International audienceWe present a new Fast Marching algorithm for a non-convex eikonal equation mod...
We present a new fast-marching algorithm for an eikonal equation with a velocity changing sign. This...
In these notes, we present an introduction to the classical Fast Marching Method (FMM). The FMM has ...
International audienceIn \cite{CFFM06}, the authors have proposed a generalization of the classical ...
In this paper we introduce an extension of the Fast Marching Method introduced by Sethian [6] for th...
International audienceThe fast marching method is computationally efficient in approximating the vis...
We introduce and analyze a fast version of the semi-Lagrangian algorithm for front propagation origi...
The focus of this thesis is on the design of an algorithm that captures the non-monotone propagation...
International audienceIn this paper, we consider a Generalized Fast Marching Method (GFMM) as a nume...
Abstract. A computational study of the fast marching and the fast sweeping methods for the eikonal e...
AbstractA new front marching algorithm for solving the eikonal equation is presented. An important p...
Abstract. The non-monotonic propagation of fronts is considered. When the speed function F: Rn × [0,...
The governing equation of the first arrival time of a monotonically propagating front (wavefront or ...
Abstract. A new algorithm is proposed to describe the propagation of fronts advected in the normal d...
In [4], the authors have proposed a generalization of the classical Fast Marching Method of Sethian ...